If the _____ traversal of a binary tree gives values in sorted increasing…
2018
If the _____ traversal of a binary tree gives values in sorted increasing order, then the binary tree is a Binary Search Tree (BST).
- A.
Preorder
- B.
Postorder
- C.
Inorder
- D.
Level-order
Attempted by 379 students.
Show answer & explanation
Correct answer: C
Correct answer: Inorder
In a BST, every left-subtree value is smaller than the root, and every right-subtree value is larger than the root.
Inorder traversal follows Left → Root → Right, so it visits the values in increasing order.
Therefore, if this traversal is sorted in increasing order, the tree satisfies the BST ordering property.