Binary tree traversal: Preorder, Inorder, Postorder

See complete series on data structures here:
• Data structures
In this lesson, we have described Preorder, Inorder and Postorder algorithms for binary tree traversal and analyzed their time and space complexities.
See source code here:
gist.github.co...
For more on time complexity analysis:
www.geeksforgee...
For practice problems and more, visit: www.mycodeschoo...
Like us on Facebook: / mycodeschool
Follow us on twitter: / mycodeschool