In this article we will see some more complex binary tree traversal and different techniques for same traversal. This article will contain following implementations:
- Reverse level order traversal
- Leaf node traversal
- Boundary node traversal
- Morris in-order traversal
No introduction is needed for Binary Tree I guess because it's a very common data structure and an essential element of some advance binary tree based data structure like BST, Binary Heap, Binomial Heap, Fibonacci Heap, AVL, Red-Black Tree. Nevertheless I would just request you to recall basic pro...