Menu

Question Discussion & Solution

MCQ

Q.

A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called

A

AVL tree

B

Red-black tree

C

Lemma tree

D

None of the above

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 property of binary tree is

A

The first subset is called left subtree

B

The second subtree is called right subtree

C

The root cannot contain NULL

D

The right subtree can be empty

Discussion

MCQ

2.

Herder node is used as sentinel in

A

Graphs

B

Stacks

C

Binary tree

D

Queues

Discussion

MCQ

3.

The number of nodes in a complete binary tree of depth d (with root at depth 0) is

A

2^(d?1) +1

B

2^(d+1) -1

C

2^(d?1) -1

D

2^(d+1) +1

Discussion

MCQ

4.

Binary trees can have how many children?

A

2

B

any number of children

C

0 or 1 or 2

D

0 or 1

Discussion

MCQ

5.

Unlike a general tree, each node in a binary tree is restricted to have at the most __________child nodes only.

A

Four

B

Three

C

Two

D

One

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