Menu

Question Discussion & Solution

MCQ

Q.

What are the disadvantages of normal binary tree traversals?

A

there are many pointers which are null and thus useless

B

there is no traversal which is efficient

C

complexity in implementing

D

improper traversals

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.

Like _________- binary trees can also be represented in two ways in the memory

A

Stacks

B

Queues

C

Strings

D

Both (a) and (b)

Discussion

MCQ

2.

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

A

31

B

16

C

32

D

15

Discussion

MCQ

3.

Express -15 as a 6-bit signed binary number.

A

1111

B

101111

C

101110

D

1110

Discussion

MCQ

4.

Which of the following is false about a binary search tree?

A

The left child is always lesser than its parent

B

The right child is always greater than its parent

C

The left and right sub-trees should also be binary search trees

D

None of the mentioned

Discussion

MCQ

5.

The complexity of Binary search algorithm is

A

O(n)

B

O(log )

C

O(n^2)

D

O(n log n)

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