Skip to Main Content
| Brooklyn College Library & Academic IT |CISC Department

CISC 3130 Data Structures: Tree Traversals

Professor Chuang Spring 2020 OER

Introduction

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

Creative Commons License NC SA 4.0 icon This OER resource is released under Creative Commons Attribution-Non Commercial-ShareAlike 4.0 International License. It was made for the Spring 2020 semester by Professor Katherine Chuang on Data Structures at Brooklyn College, Department of Computer and Information Science.