Menu

Question Discussion & Solution

MCQ

Q.

A full binary tree with n non-leaf nodes contains

A

2n nodes

B

n - 1 nodes

C

log2n nodes

D

2n + 1 nodes

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.

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

2.

What is the time complexity for finding the height of the binary tree?

A

h = O(loglogn)

B

h = O(nlogn)

C

h = O(n)

D

h = O(log n)

Discussion

MCQ

3.

In a full binary tree if there are L leaves, then total number of nodes N are?

A

N = 2L

B

N = L + 1

C

N = L

D

N = 2L

Discussion

MCQ

4.

Herder node is used as sentinel in

A

Graphs

B

Stacks

C

Binary tree

D

Queues

Discussion

MCQ

5.

What is the maximum possible number of nodes in a binary tree at level 6?

A

36

B

6

C

1

D

64

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