Breadth First Traversal

Last updated Dec 14, 2021 Edit Source

• Cs algorithms
• Cs trees

In breadth first Tree Traversal, the nodes at the same depth(Important Tree Terminology) are visited first, before visiting the nodes at higher depths. A queue is commonly used in order to achieve this.