BFT
From charlesreid1
Breadthfirst traversal using queues
Breadthfirst traversal: same idea as breadthfirst search BFS, except for traversing the tree. So, instead of searching for something in the tree, you're performing a visit action.
When doing BFT, use a queue. The pseudocode looks like this:
add root to queue while queue not empty: remove next item from queue perform visit action on item add children queue
Related
Graphs:
 Graphs#Graph Traversals
 Graphs/Depth First Traversal
 Graphs/Breadth First Traversal
 Graphs/Euler Tour
Traversals on trees:
Breadthfirst search and traversal on trees:
 BFS  breadth first search
 BFT  breadth first traversal
Depthfirst search and traversal on trees:
OOP design patterns:
Flags
Trees Part of Computer Science Notes
Series on Data Structures Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree · SimpleTree
Tree Traversal Preorder traversal: Trees/Preorder Postorder traversal: Trees/Postorder InOrder traversal: Binary Trees/Inorder BreadthFirst Search: BFS BreadthFirst Traversal: BFT DepthFirst Search: DFS DepthFirst Traversal: DFT OOP Principles for Traversal: Tree Traversal/OOP · Tree Traversal/Traversal Method Template Tree operations: Trees/Operations Performance · Trees/Removal
Tree Applications Finding Minimum in Log N Time: Tree/LogN Min Search
Abstract data type: Binary Trees/ADT Concrete implementations: Binary Trees/LinkedBinTree · Binary Trees/ArrayBinTree Binary Trees/Cheat Sheet · Binary Trees/OOP · Binary Trees/Implementation Notes
