Menu

Question Discussion & Solution

MCQ

Q.

When converting binary tree into extended binary tree, all the original nodes in binary tree are

A

internal nodes on extended tree

B

external nodes on extended tree

C

vanished on extended tree

D

None of 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.

If all c(i, j )

A

O(n log n)

B

O(n^3)

C

O(n^2)

D

O(log n)

E

O(n^4).

Discussion

MCQ

2.

Traversing a binary tree first root and then left and right subtrees called _______traversal.

A

inorder

B

preorder

C

postorder

D

none of these

Discussion

MCQ

3.

Which of the following graph traversals closely imitates level order traversal of a binary tree?

A

Depth First Search

B

Breadth First Search

C

Depth & Breadth First Search

D

None of the mentioned

Discussion

MCQ

4.

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

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