Binary Trees Questions

MCQ bookmark_border

1.

A binary tree whose every node has either zero or two children is called

A

Complete binary tree

B

Binary search tree

C

Extended binary tree

D

None of above

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

2.

The depth of a complete binary tree is given by

A

Dn = n log2n

B

Dn = n log2n+1

C

Dn = log2n

D

Dn = log2 (n+1)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

3.

When representing any algebraic expression E which uses only binary operations in a 2-tree

A

the variable in E will appear as external nodes and operations in internal nodes

B

the operations in E will appear as external nodes and variables in internal nodes

C

the variables and operations in E will appear only in internal nodes

D

the variables and operations in E will appear only in external nodes

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

4.

A binary tree can easily be converted into q 2-tree

A

by replacing each empty sub tree by a new internal node

B

by inserting an internal nodes for non-empty node

C

by inserting an external nodes for non-empty node

D

by replacing each empty sub tree by a new external node

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

5.

. 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

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

6.

The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

A

ABFCDE

B

ADBFEC

C

ABDECF

D

ABDCEF

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

7.

An algorithm that calls itself directly or indirectly is known as

A

Sub algorithm

B

Recursion

C

Polish notation

D

Traversal algorithm

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

8.

In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called

A

Leaf

B

branch

C

path

D

thread

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

9.

The in order traversal of tree will yield a sorted listing of elements of tree in

A

Binary trees

B

Binary search trees

C

Heaps

D

None of above

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

10.

The complexity of Binary search algorithm is

A

O(n)

B

O(log )

C

O(n^2)

D

O(n log n)

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion