A Binary Search Tree (BST) stores values in the range 37 to 573. Consider the…

PYQ GATE 2008

A Binary Search Tree (BST) stores values in the range 37 to 573. Consider the following sequence of keys.

I. 81, 537, 102, 439, 285, 376, 305

II. 52, 97, 121, 195, 242, 381, 472

III. 142, 248, 520, 386, 345, 270, 307

IV. 550, 149, 507, 395, 463, 402, 270

Suppose the BST has been unsuccessfully searched for key 273. Which all of the above sequences list nodes in the order in which we could have encountered them in the search?

  1. A.

    II and III only

  2. B.

    I and III only

  3. C.

    III and IV only

  4. D.

    III only

Attempted by 243 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…