Trees Questions

MCQ bookmark_border

11.

Which method can find if two vertices x & y have path between them?

A

Depth First Search

B

Breadth First Search

C

Both A & B

D

None A or B

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

12.

Access time of a binary search tree may go worse in terms of time complexity upto

A

?(n2)

B

?(n log n)

C

?(n)

D

?(1)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

13.

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

A

In-order Traversal

B

Pre-order Traversal

C

Post-order Traveral

D

None of the above

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

14.

In the deletion operation of max heap, the root is replaced by

A

next available value in the left sub-tree.

B

next available value in the right sub-tree.

C

any random value from the heap.

D

last element of the last level

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

15.

All possible spanning trees of graph G

A

have same number of edges and vertices.

B

have same number of edges and but not vertices.

C

have same number of vertices but not edges.

D

depends upon algorithm being used.

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

16.

Maximum number of nodes in a binary tree with height k, where root is height 0, is

A

2k ? 1

B

2k+1 ? 1

C

2k-1 + 1

D

2k ? 1

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

17.

Re-balancing of AVL tree costs

A

?(1)

B

?(log n)

C

?(n)

D

?(n2)

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

18.

In the

A

Depth First

B

Breadth First

C

Width First

D

Depth Limited

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

19.

State true or false.i) The degree of root node is always zero.ii) Nodes that are not root and not leaf are called as internal nodes.

A

True, True

B

True, False

C

False, True

D

False, False

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

20.

Any node is the path from the root to the node is called

A

Successor node

B

Ancestor node

C

Internal node

D

None of the above

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion