Menu

Question Discussion & Solution

MCQ
Q.
Why we need to a binary tree which is height balanced?

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.
In order to get the contents of a Binary search tree in ascending order, one has to traverse it in
forum Discussion
MCQ
2.
Sequential search has a time complexity of O(n), and binary search has a time complexity of O(log(n)). What difference will it make when the size n is 1000?
forum Discussion
MCQ
3.
A binary tree is said to be an extended binary tree (also known as 2-tree) if all of its nodes are of _______.
forum Discussion
MCQ
4.
What is the speciality about the inorder traversal of a binary search tree?
forum Discussion
MCQ
5.
What is a full binary tree?
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
article

Abstract data types

format_list_bulleted 37 MCQs
article

Arrays

format_list_bulleted 134 MCQs
article

Lists

format_list_bulleted 166 MCQs
article

Stacks

format_list_bulleted 165 MCQs
article

Queues

format_list_bulleted 61 MCQs
article

Trees

format_list_bulleted 133 MCQs
article

Binary Trees

format_list_bulleted 120 MCQs
article

B Trees

format_list_bulleted 8 MCQs
article

Heaps

format_list_bulleted 36 MCQs
article

Hash based structures

format_list_bulleted 7 MCQs
article

Graphs

format_list_bulleted 157 MCQs
article

Mixed

format_list_bulleted 10 MCQs