Trees Questions

MCQ bookmark_border

51.

Which amongst the following cannot be a balance factor of any node of an AVL tree?

A

1

C

2

D

-1

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

52.

Level of any node of a tree is

A

Height of its left subtree minus height of its right subtree

B

Height of its right subtree minus height of its left subtree

C

Its distance from the root

D

None of these

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

53.

Visiting root node after visiting left and right sub-trees is called .............

A

In-order Traversal

B

Pre-order Traversal

C

Post-order Traversal

D

None of these

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

54.

A tree in which, for every node, the difference between the height of its left subtree and right subtree is not more than one is

A

Complete Binary Tree

B

B

C

B+ Tree

D

AVL Tree

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

55.

The balance factor for an AVL tree is either

A

0,1 or -1

B

-2,-1 or 0

C

0,1 or 2

D

All the above

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

56.

AVL trees have LL, LR, RR, RL rotations to balance the tree to maintain the balance factor (LR : Insert node in Right sub tree of Left sub tree of node A, etc). Among rotations the following are single and double rotations

A

LL, RL and LR, RR

B

LL, RR and LR, RL

C

LR, RR and LL, RL

D

LR, RL and LR, RL Answer: B

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

57.

Which one of the following statements is false?

A

Breadth-first search cannot be used to find connected components of a graph.

B

Given the prefix and postfix walks of a binary tree, the binary tree cannot be uniquely reconstructed.

C

Both (a) and (b)

D

Optimal binary search tree construction can be performed efficiently using dynamic programmmg.

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

58.

A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?

A

Inorder

B

Preorder

C

Postorder

D

None of these

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

59.

Which of the following statements is false ?

A

A tree contains a cycle

B

A tree is a connected graph

C

Every tree is a bipartite graph

D

A tree with n nodes contains n-1 edges

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

60.

Which of the following remarks about Tree- indexing are true?

A

It is an m-ary tree

B

Successful searches should terminate in leaf nodes

C

Unsuccessful searches may terminate in leaf nodes level of the tree structure

D

All of these

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion