Data Structures: Binary Trees and Traversal Algorithms
This video provides an introduction to binary trees. It illustrates the difference between a full and a complete binary tree. Finally, the Depth-First-Search (preorder DFS, in-order DFS, and post-order DFS) and Breadth-First-Search traversal algorithms are illustrated along an example.
For more details on tree traversal algorithms, check out these videos:
Pre-order DFS: • Data Structures: Preorder Depth First...
Post-order Depth-First-Search (DFS): • Data Structures: Post-order Depth Fir...
Breadth-First-Search (BFS): • Data Structures: Breadth First Search...