If the inorder traversal of a Binary Search Tree is 10, 20, 30, 40, 50, what can be concluded?

Options

  • A. The sequence is in descending order
  • B. The sequence is in ascending order
  • C. The tree must be a complete binary tree
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

B. The sequence is in ascending order

Detailed Explanation

An important property of a Binary Search Tree is that its inorder traversal produces the keys in ascending order. Therefore, 10, 20, 30, 40, 50 is consistent with the inorder traversal of a BST. However, this sequence alone does not determine the exact shape of the tree. Several different BST structures can have the same inorder sequence, depending on insertion order and tree configuration.

← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts