Binary Trees Questions

MCQ bookmark_border

81.

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

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

82.

If each node in a tree has value greater the every value in its left subtree and has value less than every value in its right subtree, the tree is called

A

AVL tree

B

Complete tree

C

Full binary tree

D

Binary search tree

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

83.

The number of nodes in a complete binary tree of level 5 is

A

10

B

21

C

63

D

77

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

84.

A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves

A

Has exactly 17 nodes

B

Has exactly 19 nodes

C

Cannot have more than 19 nodes

D

None of these

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

85.

Number of possible binary trees with 3 nodes is

A

5

B

7

C

9

D

11

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

86.

A binary tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20,58, 91, 3,8,37, 60, 24 The number of nodes in the leftof the root respectively is

A

(3,6)

B

(4,7)

C

(6,3)

D

(7,4)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

87.

Consider the following nested representation of binary trees indicates y and z are the left right subtrees, respectively, of node x. Note that y and z may be NULL or further nested. Which of the following represents a valid binary tree?

A

(1(234)(567)

B

(1 2(4 5 6 7))

C

(1(2 3 NULL)(4 5))

D

1((2 3 NULL)4 5 6)7)

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

88.

A full binary tree with n non-leaf nodes contains

A

2n nodes

B

n - 1 nodes

C

log2n nodes

D

2n + 1 nodes

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

89.

The depth of a complete binary tree with 'n nodes is (log is to be base two)

A

log(n)

B

log(n) + 1

C

log (n-1) + 1

D

log (n+1)-1

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

90.

When to choose Red-Black tree, AVL tree and B-trees?

A

many inserts, many searches and when managing more items respectively

B

many searches, when managing more items respectively and many inserts respectively

C

sorting, sorting and retrieval respectively

D

retrieval, sorting and retrieval respectively

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion