Skip to Main Content
It looks like you're using Internet Explorer 11 or older. This website works best with modern browsers such as the latest versions of Chrome, Firefox, Safari, and Edge. If you continue with this browser, you may see unexpected results.
| Brooklyn College Library & Academic IT |CISC Department

CISC 3130 Data Structures: Tree Traversals

Professor Chuang Spring 2020 OER


Traversing through trees can be completed by breadth first or by depth first. Breadth First Search (BFS) traverses through tree nodes level by level. Depth First Search (DFS) starts from the root and reaches the leaves of a subtree before another subtree.

Tree Traversals