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.
求二叉树的直径
一开始没有发现某个节点的最长路径长度就是它左右的子树的深度之和加1
public int diameterOfBinaryTree(TreeNode root) {
if (root == null) return 0;
return Math.max(Math.max(diameterOfBinaryTree(root.left), diameterOfBinaryTree(root.right)), getHigh(root.left) + getHigh(root.right) );
}
public int getHigh(TreeNode root) {
if (root == null) return 0;
return 1 + Math.max(getHigh(root.left), getHigh(root.right));
}