July2016 cs Q21

0. Consider the following binary search tree : If we remove the root node, which of the node from the left subtree will be the new root ?

Answer
Comment
Array

Option : D
Explanation :
When we delete root node, tree will be

but this tree is not balance, so we will find inorder predecessor or inorder successor and replace it with root node now. In this problem we will use inorder predecessor-Root node will be 16.

So, option (D) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.