Menu

Question Discussion & Solution

MCQ

Q.

The number of nodes that have no successors in a complete binary tree of depth 4 is

B

8

C

16

D

4

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 number of nodes in a complete binary tree of level 5 is

A

10

B

21

C

63

D

77

Discussion

MCQ

2.

Worst case efficiency of binary search is

A

log2 n + 1

B

n

C

2n

D

log n.

Discussion

MCQ

3.

The depth of a complete binary tree is given by

A

Dn = n logn+1

B

Dn = logn

C

Dn = logn+1

D

Dn = n logn

Discussion

MCQ

4.

The complexity of Binary search algorithm is

A

O(n)

B

O(n²)

C

O(log n)

D

O(n log n)

Discussion

MCQ

5.

A binary tree of depth "d" is an almost complete binary tree if

A

for any node

B

each leaf in the tree is either at level

C

both (a) and (b)

D

None of these

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