Tree Traversal

Depth First Search

Breadth First Search

Last updated 7 months ago

Depth First Search

DFS will only store as much memory on the stack as is required for the longest root to leaf path in the tree. In other words, it space usage is $\text{O}(h)$ where $h$ is the height of the tree.

Breadth First Search

DFS will only store as much memory on the stack as is required for the longest root to leaf path in the tree. In other words, it space usage is $\text{O}(h)$ where $h$ is the height of the tree.