Consider the following Binary Search Tree (BST). Which node contains the…
2014
Consider the following Binary Search Tree (BST). Which node contains the fourth smallest element in T?
- A.
Q
- B.
V
- C.
W
- D.
X
Attempted by 329 students.
Show answer & explanation
Correct answer: C
Correct answer: W
In a BST, inorder traversal visits nodes in ascending order. So the fourth smallest node is the fourth node in the inorder sequence.
Inorder sequence: U, Q, X, W, P, V, Z, Y
Counting from the start: U is 1st, Q is 2nd, X is 3rd, and W is 4th.
A video solution is available for this question — log in and enroll to watch it.