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...
On this page of the site you can watch the video online Data Structures: Binary Trees and Traversal Algorithms with a duration of hours minute second in good quality, which was uploaded by the user CS Hero 13 September 2022, share the link with friends and acquaintances, this video has already been watched 38 times on youtube and it was liked by 0 viewers. Enjoy your viewing!