1. Which traversal of tree resembles the breadth first search of the graph?
A) Postorder
B) Inorder
C) Preorder
D) Levelorder
Correct Answer: Levelorder
Explanation : Levelorder traversal of tree resembles the breadth first search of the graph.
Graphs
Topic Covered : Definition and notations, Components of Graphs, Types of Graphs, Graph Implementation using Adjacency Matrix and Adjacency List algorithms and programs, Graph Traversal Methods: Depth First Search and Breadth First Search.