The diameter of a tree (sometimes called the width) is the number of nodes on the longest path between two end nodes. In this post, we will see how to print the nodes involved in the diameter of the tree. The diagram below shows two trees each with diameter nine, the leaves that form the ends of the longest path are shaded (note that there is more than one path in each tree of length nine, but no path longer than nine nodes).
Input: 1 / \ 2 3 / \ 4 5 Output : 4 2 1 3 or 5 2 1 3 Input: 1 / \ 2 3 / \ \ 4 5 6 Output : 4 2 1 3 6 or 5 2 1 3 6
We have already discussed how to find the diameter of a binary tree.Diameter of a Binary tree
We know that Diameter of a tree can be calculated by only using the height function because the diameter of a tree is nothing but the maximum value of (left_height + right_height + 1) for each node.
Now for the node which has the maximum value of (left_height + right_height + 1), we find the longest root to leaf path on the left side and similarly on the right side. Finally, we print left side path, root and right side path.
Time Complexity is O(N). N is the number of nodes in the tree.
9 8 4 2 5 6
- Longest Path with Same Values in a Binary Tree
- Sum of nodes on the longest path from root to leaf node
- Sum of all the parent nodes having child node x
- Print the nodes at odd levels of a tree
- Diameter of a Binary Tree in O(n) [A new method]
- Print path from root to a given node in a binary tree
- Longest path in an undirected tree
- Check if there is a root to leaf path with given sequence
- Print cousins of a given node in Binary Tree
- Print root to leaf paths without using recursion
- Diagonal Sum of a Binary Tree
- Print nodes at k distance from root
- Given a binary tree, print all root-to-leaf paths
- Diameter of a Binary Tree
- Given a binary tree, print out all of its root-to-leaf paths one per line.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.