Question

Which method of traversal does not use stack to hold nodes that are waiting to be processed?

Answer 1

BFS is method of traversal which does not use stack to hold nodes that are waiting to be processed, it uses queue.

Answer 2

Answer:

The correct answer is BFS that is Breadth-first search.

Explanation:

Breadth-first search is an algorithm in Computer science field for searching a tree data structure for a node that satisfies a given property. It starts from the tree root and then explores all nodes at the present depth prior to moving on to the nodes at the next depth level.

It is method of traversing which does not use stack to hold nodes that are waiting to be processed instead it uses queue.