Data Structures | Binary Search Trees | Question 7

Last Updated :
Discuss
Comments

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)? (GATE CS 2004)
 

2
 

3
 

4
 

6
 

This question is part of this quiz :

Top MCQs on Binary Search Tree (BST) Data Structure with Answers
Tags:
DSA Quiz
Data Structures
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy