Menu

Question Discussion & Solution

MCQ

Q.

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

A

to avoid formation of skew trees

B

to save memory

C

to attain faster memory access

D

to simplify storing

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

The maximum number of nodes in a binary tree of depth 5 is ...............

A

31

B

16

C

32

D

15

Discussion

MCQ

2.

The pre-order traversal of a binary-search tree is DBACFE. What is the post-order traversal?

A

ABFCDE

B

ADBFEC

C

ABFEDC

D

ACBEFD

Discussion

MCQ

3.

What are the children for node

A

2w and 2w+1

B

2+w and 2-w

C

w+1/2 and w/2

D

w-1/2 and w+1/2

Discussion

MCQ

4.

A complete binary tree with n leaf nodes has ..............

A

n+1 nodes

B

2n-1 nodes

C

2n+1 nodes

D

n(n-1)/2 nodes

Discussion

MCQ

5.

The process of inserting a node in a binary search tree can be divided into how many steps?

A

Three

B

Two

C

Four

D

None of the above

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs