Menu

Question Discussion & Solution

MCQ

Q.

A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves

A

Has exactly 17 nodes

B

Has exactly 19 nodes

C

Cannot have more than 19 nodes

D

None of these

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.

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

2.

The time complexity of binary search in best, worst cases for an array of size N is

A

N, N2

B

1, Log N

C

Log N, N2

D

1, N log N

Discussion

MCQ

3.

One can make an exact replica of a Binary Search Tree by traversing it in ...............

A

In-order

B

Pre-order

C

Post-order

D

Any order

Discussion

MCQ

4.

In the array representation, what is represented sequentially in memory using a single one-dimensionalarray?

A

Binary tree

B

Stacks

C

Nodes

D

None of the above

Discussion

MCQ

5.

Herder node is used as sentinel in

A

Graphs

B

Stacks

C

Binary tree

D

Queues

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