UPPCL 2018 AE

Question

Let B1 is binary search tree initially  empty  then we insert the element in oder  1,2,3,4,5 .

Let B2 is another binary search tree initially empty we insert the same element in reverse order

difference between Rightmost element of B1 BST and Leftmost element of B2 BST

• A. 4
• B. 1
• C. 5
• D. 3

Comments

A )

Answer 1

The Two trees will be right skewed with 5 as righmost element, and left skewed with 1 as left most element.

Therefore, 5-1=4 i.e. Option A.