Gate CS-2015-3 Question Paper With Solutions

Q. 20 While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree
(BST) in the sequence shown, the element in the lowest level is

(A) 65

(B) 67

(C) 69

(D) 83

Answer: (B)

Explanation:

Gate CS-2015-3 Question Paper With Solutions

Gate CS-2015-3 Question Paper With Solutions

Learn More:   Gate EE-2003 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here