Binary tree traversal - breadth-first and depth-first strategies @mycodeschool

Binary tree traversal - breadth-first and depth-first strategies @mycodeschool

Uploaded February 2014 | Updated September 2026, 2 weeks ago

See complete series on data structures here:
youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P

In this lesson, we have discussed algorithms for binary tree traversal. We have talked about breadth-first and depth-first strategies for tree traversal like level-order, preorder, inorder and postorder.

For practice problems and more, visit: mycodeschool.com

Like us on Facebook: facebook.com/MyCodeSchool

Follow us on twitter: twitter.com/mycodeschool

Binary tree traversal - breadth-first and depth-first strategies

Data structures: Linked List implementation of Queue

Pointers and arrays

Introduction to programming and programming languages: C Programming Tutorial 01

Data structures: Properties of Graphs

Character arrays and pointers - part 1

Binary search tree - Implementation in C/C++

Quicksort algorithm

Arrays as function arguments

Pointers as function returns in C/C++

Data structures: Introduction to stack

Memory leak in C/C++

Binary tree traversal - breadth-first and depth-first strategies