Part 6 of 15 in Binary Trees  

Binary tree traversal: Inorder, Preorder, Postorder

In this lesson, we have described Preorder, Inorder and Postorder algorithms for binary tree traversal and analyzed their time and space complexities.