Which of the following is FALSE about a binary search tree ?
2024
Which of the following is FALSE about a binary search tree ?
- A.
The left child is always lesser than its parent
- B.
The right child is always greater than its parent
- C.
The left and right subtrees should also be binary search trees
- D.
In-order sequence gives decreasing order of elements
Attempted by 90 students.
Show answer & explanation
Correct answer: D
In-order traversal of a Binary Search Tree visits nodes in ascending order, not descending. This is because left subtree values are always less than the root and right subtree values are greater.