Binary Trees Questions

MCQ bookmark_border

61.

The in-order traversal of a binary tree is HFIEJGZ, and the post-order traversal of the same tree is HIFJZGE. What will be the total number of nodes in the left sub tree of the given tree? (It is NOT a search tree)

A

1

B

2

C

3

D

4

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

62.

If the in-order and pre-order traversal of a binary tree are D,B,F,E,G,H,A,C and A,B,D,E,F,G,H,C respectively then the post-order traversal of that tree is

A

D,F,G,A,B,C,H,E

B

F,H,D,G,E,B,C,A

C

C,G,H ,F,E,D,B,A

D

D,F,H,G,E,B,C,A

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

63.

In a binary tree, the number of terminal or leaf nodes is 10. The number of nodes with two children is

A

9

B

11

C

25

D

20

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

64.

The pre-order traversal of a binary-search tree is DBACFE. What is the post-order traversal?

A

ABFCDE

B

ADBFEC

C

ABFEDC

D

ACBEFD

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

65.

How many distinct binary search trees can be formed which contains the integers 1, 2, 3?

A

6

B

5

C

4

D

3

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

66.

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

B

8

C

16

D

4

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

67.

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

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

68.

A complete Binary Tree with 15 nodes contains ................. edges.

A

15

B

30

C

14

D

16

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

69.

A complete binary tree with the property that the value of each node is at least as large as the values of its children is known as ..............

A

Binary Search Tree

B

AVL Tree

C

Heap

D

Threaded Binary Tree

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

70.

A binary tree stored using linked representation can be converted to its mirror image by traversing it in ...............

A

In-order

B

Pre-order

C

Post-order

D

Any order

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion