Menu

Question Discussion & Solution

MCQ

Q.

The depth of a binary tree is the highest level number of any ______ in the binary tree.

A

Leaf node

B

Parent node

C

Sibling node

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.

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

2.

In a binary search tree, which of the following traversals would print the numbers in the ascending order?

A

Level-order traversal

B

Pre-order traversal

C

Post-order traversal

D

In-order traversal

Discussion

MCQ

3.

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

Discussion

MCQ

4.

What is the parent for a node

A

floor(w-1/2)

B

ceil(w-1/2)

C

w-1/2

D

w/2

Discussion

MCQ

5.

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

A

31

B

16

C

32

D

15

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