Consider lines of slope -1 passing between nodes. Given a Binary Tree, print all diagonal elements in a binary tree belonging to same line.
Input : Root of below tree Output : Diagonal Traversal of binary tree : 8 10 14 3 6 7 13 1 4
We have discussed recursive solution in below post.
In this post, iterative solution is discussed. The idea is to use a queue to store only the left child of current node. After printing the data of current node make the current node to its right child, if present.
A delimiter NULL is used to mark the starting of next diagonal.
Below is the implementation of above approach.
8 10 14 3 6 7 13 1 4
- Diagonal Traversal of Binary Tree
- Kth node in Diagonal Traversal of Binary Tree
- Iterative Boundary traversal of Complete Binary tree
- Iterative Preorder Traversal of an N-ary Tree
- Check whether a binary tree is a full binary tree or not | Iterative Approach
- Construct Full Binary Tree using its Preorder traversal and Preorder traversal of its mirror tree
- Diagonal Sum of a Binary Tree
- Given level order traversal of a Binary Tree, check if the Tree is a Min-Heap
- Iterative Search for a key 'x' in Binary Tree
- Largest value in each level of Binary Tree | Set-2 (Iterative Approach)
- Get level of a node in binary tree | iterative approach
- Check for Symmetric Binary Tree (Iterative Approach)
- Iterative Method to find Height of Binary Tree
- Iterative approach to check if a Binary Tree is Perfect
- Check whether a given Binary Tree is Complete or not | Set 1 (Iterative Solution)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : andrew1234