C-Programming-data-structure || 2017 SET 1 || MCQ || 1-mark || Module 3: Tree | Graph | Hashing1

Last Updated :
Discuss
Comments

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:

Note: The height of a tree with a single node is 0. 2017 SET 1 || MCQ || 1-mark

4 and 15 respectively


3 and 14 respectively


4 and 14 respectively


3 and 15 respectively

This question is part of this quiz :

GATE|| C Programming & Data Structure || Pyqs (2010 to 2025 ),GATE || Tree | Graph || PYQS (2010 to 2025)
Tags:
GATE CS
Data Structures
GATE CS
Share your thoughts in the comments
Article Tags :