Trees Questions

MCQ bookmark_border

61.

Which of the following statements is/are correct ?

A

If each tree node contains a father field, then it's not necessary to use either stack or threads

B

A in-threaded binary tree is defined as binary tree that is both left-in threaded and right-in

C

Both (a) and (b)

D

Traversal using father pointers is more time efficient than traversal of a threaded tree

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

62.

A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves could be

A

2

B

4

C

6

D

8

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

63.

Is the below tree representation of 50,100,400,300,280 correct way to represent cartesian tree?

A

1

C

may be

D

can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

64.

What are the operations that can be performed on weight balanced tree?

A

all basic operations and set intersection, set union and subset test

B

all basic operations

C

set intersection, set union and subset test

D

only insertion and deletion

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

65.

Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as

A

log2 n

B

log4/3 n

C

log3 n

D

log3/2 n

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

66.

Why the below pseudo code where x is a value, wt is weight factor and t is root node can

A

when x>t. element Rotate-with-left-child should take place and vice versa

B

the logic is incorrect

C

the condition for rotating children is wrong

D

insertion cannot be performed in weight balanced trees

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

67.

What does the below definations convey?i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.

A

weight balanced and height balanced tree definations

B

height balanced and weight balanced tree definations

C

definations of weight balanced tree

D

definations of height balanced tree

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

68.

Elements in a tree can be indexed by its position under the ordering of the keys and the ordinal position of an element can be determined, both with good efficiency.

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

69.

What is the special property of red-black trees and what root should always be?

A

a color which is either red or black and root should always be black color only

B

height of the tree

C

pointer to next node

D

a color which is either green or black

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

70.

Why do we impose restrictions like. root property is black. every leaf is black. children of red node are black. all leaves have same black

A

to get logarithm time complexity

B

to get linear time complexity

C

to get exponential time complexity

D

to get constant time complexity

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion