Consider the following binary search tree T given below. Which node contains the fourth smallest element in T ?

This question was previously asked in

ISRO Scientist CS 2014 Official Paper

- Q
- V
- W
- X

Option 3 : W

Free

ISRO Scientist CS 2020 Official Paper

735

80 Questions
240 Marks
90 Mins

The correct answer is **option 3.**

__Key Points__

- The binary search tree's in-order traverse provides the
**ascending order**of the elements. **UQXWPVZY**is the in-order traversal of this tree.- Therefore the fourth-smallest element is the 4th in order element
**, W.**

****

**∴ Hence the correct answer is** W.

**Additional Information**

**The above tree in order is** 10, 15, 16, 19, 20, 25, 27, 30. So the 4^{th }smallest element is **19.** So the 4th smallest element is **W.**

India’s **#1 Learning** Platform

Start Complete Exam Preparation

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Trusted by 2,16,60,796+ Students

Testbook Edu Solutions Pvt. Ltd.

1st & 2nd Floor, Zion Building,

Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

[email protected]
Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

Toll Free:1800 833 0800

Office Hours: 10 AM to 7 PM (all 7 days)