Menu

Question Discussion & Solution

MCQ
Q.
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.

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
A complete binary tree with the property that the value at each node is at least as large as the values at its children is called
forum Discussion
MCQ
2.
A binary tree having n nodes and depth d will be about complete binary tree if
forum Discussion
MCQ
3.
A binary tree of depth
forum Discussion
MCQ
4.
Binary search tree is an example of complete binary tree with special attributes.
forum Discussion
MCQ
5.
What is a threaded binary tree traversal?
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
Practice arrow_forward
article

Abstract data types

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Arrays

format_list_bulleted 134 MCQs
Practice arrow_forward
article

Lists

format_list_bulleted 166 MCQs
Practice arrow_forward
article

Stacks

format_list_bulleted 165 MCQs
Practice arrow_forward
article

Queues

format_list_bulleted 61 MCQs
Practice arrow_forward
article

Trees

format_list_bulleted 133 MCQs
Practice arrow_forward
article

Binary Trees

format_list_bulleted 120 MCQs
Practice arrow_forward
article

B Trees

format_list_bulleted 8 MCQs
Practice arrow_forward
article

Heaps

format_list_bulleted 36 MCQs
Practice arrow_forward
article

Hash based structures

format_list_bulleted 7 MCQs
Practice arrow_forward
article

Graphs

format_list_bulleted 157 MCQs
Practice arrow_forward
article

Mixed

format_list_bulleted 10 MCQs
Practice arrow_forward