Binary Trees Questions

MCQ bookmark_border

31.

The depth of a complete binary tree is given by

A

Dn = n logn+1

B

Dn = logn

C

Dn = logn+1

D

Dn = n logn

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

32.

A binary tree can easily be converted into a 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

33.

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

34.

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

35.

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

36.

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

37.

Let T be a binary search tree with 15 nodes. The minimum and maximum possible heights of T are:Note: The height of a tree with a single node is 0.

A

4 and 15 respectively

B

3 and 14 respectively

C

4 and 14 respectively

D

3 and 15 respectively

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

38.

If a node having two children is deleted from a binary tree, it is replaced by its

A

Inorder predecessor

B

Inorder successor

C

Preorder predecessor

D

None of the above

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

39.

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 known as

A

full binary tree

B

AVL tree

C

threaded tree

D

complete binary tree

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

40.

A full binary tree with n leaves contains

A

n nodes

B

log n 2 nodes

C

2n

D

2 nodes

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion