A Binary Search Tree (BST) is constructed by inserting the following elements…

PYQ IBPS SO CRP SPL-XIV (2024)

A Binary Search Tree (BST) is constructed by inserting the following elements in the given order:

46, 72, 39, 58, 21, 13, 65, 87, 99

What will be the inorder traversal of the BST?

  1. A.

    46, 39, 21, 13, 72, 58, 65, 87, 99

  2. B.

    13, 21, 39, 46, 58, 65, 72, 87, 99

  3. C.

    99, 87, 72, 65, 58, 46, 39, 21, 13

  4. D.

    13, 39, 21, 46, 58, 72, 65, 87, 99

  5. E.

    21, 13, 39, 46, 65, 58, 72, 99, 87

Attempted by 67 students.

Sign up free to check your answer

Sign up free

Explore the full course: Ibps So It Mains

Loading lesson…