Virtual Labs

1. How is a tree different from a graph in terms of traversal?

a: Depth first traversal is not possible for graphs, but can be implemented in trees. Explanation

Explanation

b: A graph contains cycles, and a tree doesn’t. Hence some memory needs to be allocated to keep track of it while traversing in a graph. Explanation

Explanation

c: Breadth first traversal takes more time in graphs as compared to trees. Explanation

Explanation

d: All of the above Explanation

Explanation

2. We can rebuild binary tree using results of

a: postorder and preorder traversal Explanation

Explanation

b: preorder traversal Explanation

Explanation

c: preorder and inorder traversal Explanation

Explanation

d: None of the above Explanation

Explanation

3. To find the shortest distance between every node and starting node of the graph, which method can be used?

a: Inorder Traversal Explanation

Explanation

b: Depth First Traversal Explanation

Explanation

c: Binary Search Explanation

Explanation

d: Breadth First Traversal Explanation

Explanation

4. Let us assume a binary tree consisting of nodes a, b, c, d, e, f, g (in no particular order). If the postorder traversal on the tree gives {d, e, b, f, g, c, a} as the results. Then what are the results of preorder and inorder traversals respectively?

a: {d, f, g, a, b, c, e} and {a, f, d, g, c, b, e} Explanation

Explanation

b: {a, f, d, g, c, b, e} and {d, f, g, a, b, c, e} Explanation

Explanation

c: {a, b, d, e, c, f, g} and {d, b, e, a, f, c, g} Explanation

Explanation

d: {d, b, e, a, f, c, g} and {a, b, d, e, c, f, g} Explanation

Explanation

Tree Traversal