Binary Trees Questions

MCQ bookmark_border

91.

What is inefficient with the below threaded binary tree picture?

A

it has dangling pointers

B

nothing inefficient

C

incorrect threaded tree

D

space is being used more

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

92.

Binary trees can have how many children?

A

2

B

any number of children

C

0 or 1 or 2

D

0 or 1

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

93.

Disadvantage of using array representation for binary trees is?

A

difficulty in knowing children nodes of a node

B

difficult in finding the parent of a node

C

have to know the maximum number of nodes possible before creation of trees

D

difficult to implement

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

94.

What are the children for node

A

2w and 2w+1

B

2+w and 2-w

C

w+1/2 and w/2

D

w-1/2 and w+1/2

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

95.

What is the parent for a node

A

floor(w-1/2)

B

ceil(w-1/2)

C

w-1/2

D

w/2

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

96.

If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array ?

A

every node stores data saying which of its children exist in the array

B

no need of any changes continue with 2w and 2w+1, if node is at i

C

keep a seperate table telling children of a node

D

use another array parallel to the array with tree

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

97.

Consider a situation of writing a binary tree into a file with memory storage efficiency in mind, is array representation of tree is good?

A

yes because we are overcoming the need of pointers and so space efficiency

B

yes because array values are indexable

C

No it is not efficient in case of sparse trees and remaning cases it is fine

D

No linked list representation of tree is only fine

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

98.

Why we prefer threaded binary trees?

A

storage required by stack and queue is more

B

pointers in most of nodes of a binary tree are NULL

C

difficult to find a successor node

D

all of the mentioned

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

99.

The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)
i) from root search for the node to be deleted

ii)

iii) delete the node at

what must be statement ii) and fill up statement iii)

A

ii)-find random node,replace with node to be deleted. iii)- delete the node

B

ii)-find node to be deleted. iii)- delete the node at found location

C

ii)-find deepest node,replace with node to be deleted. iii)- delete a node

D

ii)-find deepest node,replace with node to be deleted. iii)- delete the deepest node

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

100.

Which of the following graph traversals closely imitates level order traversal of a binary tree?

A

Depth First Search

B

Breadth First Search

C

Depth & Breadth First Search

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion