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
给一棵二叉树,找出这棵二叉树的直径。直径的定义是从二叉树的一个节点到另一个节点的最长的距离。
Using recursion to solve this problem. Using a global variable to maintain current max path length. Use a helper to iterate the tree recursively. If the node have no children, return 0 means the bottom of tree. Then If not, calculate longest path from left and right seperately, compare their sum with max and return the longest one to upper level.
Code
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
private int max = 0;
public int diameterOfBinaryTree(TreeNode root) {
if (root == null){
return 0;
}
helper(root);
return max;
}
private int helper(TreeNode node){
if (node.left == null && node.right == null){
return 0;
}
int l = node.left != null ? helper(node.left) + 1 : 0;
int r = node.right != null ? helper(node.right) + 1 : 0;
max = Math.max(max, l + r);
return Math.max(l, r);
}
}
Time Complexity: O()
Space Complexity: O()
Review
A much more concise one from discussion.
public class Solution {
int max = 0;
public int diameterOfBinaryTree(TreeNode root) {
maxDepth(root);
return max;
}
private int maxDepth(TreeNode root) {
if (root == null) return 0;
int left = maxDepth(root.left);
int right = maxDepth(root.right);
max = Math.max(max, left + right);
return Math.max(left, right) + 1;
}
}