Virtual Labs

1. Let us consider V to be the total number of vertices and E to be the total number of edges in a tree. What is the time complexity of Breadth First Traversal in this tree?

a: O(E * V) Explanation

Explanation

b: O(V) Explanation

Explanation

c: O(E + V) Explanation

Explanation

d: O(E + E * V) Explanation

Explanation

2. What is the most appropriate data structure for Breadth First Traversal of a tree?

a: Linked List Explanation

Explanation

b: Queue Explanation

Explanation

c: Stack Explanation

Explanation

d: Array Explanation

Explanation

Tree Traversal