Question

Prob. 3. Given the following data 50 40 23 36 19 20 9 a) Is this a max heap, draw the tree and check if this is a max heap. b) Illustrate how you would add a new data 46 to the existing maxheap. c) From the answer obtained in part b, illustrate how you would delete the data 40 d) Now illustrate heap sort with the existing data after step c. Give steps, and find runtime. Runtime|Explanation of Algorithm 4. Construct a Binary Search Tree with the following data: 45, 12, 50, 34, 18, 5, 40 a) What is the pre-order tree traversal order? b) What the post-order tree traversal order? c) How to delete 45 from the tree How to add 42 5. Write a program in C++ to implement Binary Search Algorithm. Assume the data given in an array. Use number of data N at least more than 10. The function Binary Search should return the index of the search key V.

Answer 1

4.

BINARY SEARCH TREE

Pre-Order: Root - Left - Right
45 12 5 34 18 40 50

Post-Order: Left - Right - Root
5 18 40 34 12 50 45

Removed 45: Find it and replace it with the highest value in the left sub tree

ADDED 42: Find the place of the 42 using BST rules and insert.

004

--------------------------------------
Hit the thumbs up if you are fine with the answer. Happy Learning!