369 views
0 votes
0 votes

1 Answer

Best answer
2 votes
2 votes
we are searching for 13th smallest key

in BST left sub-tree has 7 elements so these will be smallest 7

8th smallest will be root node

then go to T2 right sub-tree and search (13-8) 5th smallest key

Ans:D
selected by

Related questions

2 votes
2 votes
0 answers
1
4 votes
4 votes
2 answers
4
Parth Shah asked Dec 11, 2018
1,379 views
Suppose binary tree has only three nodes A,B and C, and you are given the post order traversal of tree as B-A-C . The exact pre order traversal of the tree is?A)C-A-BB)A-...