Description
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.
Example:
Given a binary tree
1
/ \
2 3
/ \
4 5
Return 3, which is the length of the path [4,2,1,3] or [5,2,1,3].
Note: The length of path between two nodes is represented by the number of edges between them.
Solution
- Maitain a max integer value which is the max diameter.
- maxDepth() return the max depth of its left or right subtree, and plus 1. The result is the max depth of the subtree rooted at this node.
- The diameter of current node is the sum of its maxDepth of left subtree and right subtree.
- If current diameter larger than max diameter we have met, then update the max diameter value.
- Time complexity: O(N), N is the number of nodes in the tree. Recursively tranverse the tree once.
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
int max = 0;
public int diameterOfBinaryTree(TreeNode root) {
int m = maxDepth(root);
return max;
}
private int maxDepth(TreeNode x) {
if (x == null) return 0;
int left = maxDepth(x.left);
int right = maxDepth(x.right);
max = Math.max(max, left+right);
return Math.max(left, right) + 1;
}
}