Question

Construct a Binary Search Tree using the following data:   (5 pts)

                54           37           47           28           44           71           40           60

(Make sure to show dummy nodes)

b) Illustrate how will you search for V = 39 from the above tree and how many searches will be needed. (5 pts)

c) Illustrate how you will delete the root from the above tree, redraw the tree after deletion. (5 pts). Redraw the tree.

Answer 1

b)Total Searches needed=5 (5 Comparison)

Finding inorder successor:

Inorder successor of a node is the next node in Inorder traversal of the Binary Tree.

Here Inorder successor of node 54 is 60 (First move one step right node then keep moving left node until reach at leaf)