Suppose we have to insert the following sequence of keys into an empty binary search tree:

5, 7, 45, 60, 50, 23, 15, 54

What would be the height of binary search tree?

This question was previously asked in

NIELIT Scientist B Official Paper 2020

- 3
- 4
- 5
- 6

Option 3 : 5

Free

NIC Scientist B 2020: Full Mock Test

2745

120 Questions
120 Marks
180 Mins

The correct answer is **option 3.**

__Key Points__

A binary search tree, as a result, will be and height = 5

__Confusion Points__

** **A binary search tree, as a result, will be and height = 6

__Mistake Points__

- Here the height of the tree is not specified that's why we got multiple answers. By default, the height of the binary tree is the longest path from the root node to any leaf node in the tree.

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

India’s **#1 Learning** Platform

Start Complete Exam Preparation

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Trusted by 2,29,00,761+ 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)