Binary Trees Questions

MCQ bookmark_border

71.

The number of unused pointers in a complete binary tree of depth 5 is:

A

4

B

8

C

16

D

32

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

72.

One can determine whether a Binary tree is a Binary Search Tree by traversing it in ................

A

Pre-order

B

In-order

C

Post-order

D

Any of these

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

73.

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

A

31

B

16

C

32

D

15

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

74.

A complete binary tree with n leaf nodes has ..............

A

n+1 nodes

B

2n-1 nodes

C

2n+1 nodes

D

n(n-1)/2 nodes

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

75.

A binary tree can be converted in 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

MCQ bookmark_border

76.

Which of the following need not to be a binary tree ?

A

Heap

B

B-Tree

C

AVL-Tree

D

Search tree

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

77.

A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called

A

Threaded tree

B

Full binary tree

C

Binary Search Tree

D

Complete binary tree

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

78.

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

A

Heap

B

Binary Tree

C

Binary search tree

D

Completely balanced tree

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

79.

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

A

inorder

B

preorder

C

postorder

D

none of these

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

80.

A binary tree having n nodes and depth d will be about complete binary tree if

A

it contains log(d)+1 nodes

B

any node nd at level less than d-1 has two sons

C

for any node nd in the tree with a right descendent at level d lt must have a left son

D

all of these

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion