Which of the following graph traversals closely imitates level order traversal of a binary tree?
(a) Depth First Search
(b) Breadth First Search
(c) Depth & Breadth First Search
(d) Binary Search
This intriguing question comes from Inorder Traversal in portion Binary Trees of Data Structures & Algorithms I
I got this question by my college professor while I was bunking the class.