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
- Print the first shortest root to leaf path in a Binary Tree
- Find the maximum sum leaf to root path in a Binary Tree
- Print the nodes of binary tree as they become the leaf node
- Given a binary tree, print all root-to-leaf paths
- Print Sum and Product of all Non-Leaf nodes in Binary Tree
- Print all leaf nodes of a Binary Tree from left to right
- Given a binary tree, print out all of its root-to-leaf paths one per line.
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- Sum of nodes on the longest path from root to leaf node
- Sum of all leaf nodes of binary tree
- Closest leaf to a given node in Binary Tree
- Count Non-Leaf nodes in a Binary Tree
- Product of all leaf nodes of binary tree
- Find the closest leaf in a Binary Tree
- Program to count leaf nodes in a binary tree