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



See complete series on data structures here:

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: http://www.mycodeschool.com

Like us on Facebook: https://www.facebook.com/MyCodeSchool

Follow us on twitter: https://twitter.com/mycodeschool

41 Comments