Question: Related to data structures Code in C++ A. Explain graphically the working of Merge Sort using the following data set. 49 33 12 3 15
Related to data structures Code in C++

A. Explain graphically the working of Merge Sort using the following data set. 49 33 12 3 15 5 22 107 3 B. Suppose that we have numbers between 1 and 100 in a binary search tree and want to search for the number 45. Which (possibly multiple) of the following sequences could be the sequence of nodes examined? Also justify your answer. 1.5, 2, 1, 10, 39, 34, 77, 63. II. 1, 2, 3, 4, 5, 6, 7, 8. 9, 8, 63, 0, 4, 3, 2, 1. IV. 8, 7, 6, 5, 4, 3, 2, 1. V. 50, 25, 26, 27, 40, 44, 42. VI. 50, 25, 26, 27, 40, 44
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
