Binary tree traversal - breadth-first and depth-first strategies
By mycodeschool
Community Score: 50% | 863.1K views | 12y
0 community ratings: null thumbs up, null thumbs down
See complete series on data structures here: http://www.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: http://www.mycodeschool.com Like us on Facebook: https://www.facebook.com/MyCodeSchool Follow us on twitter: https://twitter.com/mycodeschool
Tags: Binary Tree, data structure, programming, coding, interview, Computer Programming (Professional Field), Technology, Tutorial, Software, yt:cc=on, Breadth-first Search, Tree Traversal, Depth-first Search
More from mycodeschool
- Introduction to programming and programming languages: C Programming Tutorial 01 — Score: 50%
- Graph Representation part 03 - Adjacency List — Score: 50%
- Graph Representation part 02 - Adjacency Matrix — Score: 50%
- Graph Representation part 01 - Edge List — Score: 50%
- Data structures: Properties of Graphs — Score: 50%
- Data structures: Introduction to graphs — Score: 50%