Binary Tree | Traversal

• Last Updated : 02 Jun, 2018

Recent articles on Tree Traversals !

1. Tree Traversals
2. Inorder Tree Traversal without Recursion
3. Inorder Tree Traversal without recursion and without stack!
4. Print Postorder traversal from given Inorder and Preorder traversals
5. Find all possible binary trees with given Inorder Traversal
6. Replace each node in binary tree with the sum of its inorder predecessor and successor
7. Populate Inorder Successor for all nodes
8. Inorder Successor of a node in Binary Tree
9. Find n-th node of inorder traversal
10. Level Order Tree Traversal
11. Level order traversal in spiral form
12. Level order traversal line by line
13. Level order traversal with direction change after every two levels
14. Reverse Level Order Traversal
15. Reverse tree path
16. Perfect Binary Tree Specific Level Order Traversal
17. Perfect Binary Tree Specific Level Order Traversal | Set 2
18. Reverse alternate levels of a perfect binary tree
19. Morris traversal for Preorder
20. Iterative Preorder Traversal
21. Iterative Postorder Traversal | Set 1 (Using Two Stacks)
22. Iterative Postorder Traversal | Set 2 (Using One Stack)
23. Postorder traversal of Binary Tree without recursion and without stack
24. Diagonal Traversal of Binary Tree
25. Iterative diagonal traversal of binary tree
26. Boundary Traversal of binary tree
27. Density of Binary Tree in One Traversal
28. Calculate depth of a full Binary tree from Preorder
29. Number of Binary Trees for given Preorder Sequence length
30. Modify a binary tree to get Preorder traversal using right pointers only

All articles on Binary Tree !

Quick Links :

• ‘Practice Problems’ on Trees
• ‘Quizzes’ on Binary Trees

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.