LintCode 1181: Diameter of Binary Tree (二叉树经典题)

1181. Diameter of Binary Tree

 

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

Example 1:

 

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].

Example 2:

 

Input:[2,3,#,1]

Output:2

 

Explanation:

      2

    /

   3

 /

1

Notice

The length of path between two nodes is represented by the number of edges between them.

解法1：
 

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param root: a root of binary tree
     * @return: return a integer
     */
    int diameterOfBinaryTree(TreeNode * root) {
        if (!root) return 0;
        int candidate = maxDistToLeaves(root->left) + maxDistToLeaves(root->right);
        return max(max(diameterOfBinaryTree(root->left), diameterOfBinaryTree(root->right)), candidate);
    }
    
private:
    int maxDistToLeaves(TreeNode * root) {
        if (!root) return 0;
        if (!root->left && !root->right) return 1;
        return max(maxDistToLeaves(root->left), maxDistToLeaves(root->right)) + 1;
    }
};

解法2：更简洁

class Solution {
public:
    /**
     * @param root: a root of binary tree
     * @return: return a integer
     */
    int diameterOfBinaryTree(TreeNode * root) {
        maxDepth(root);
        return diameter;
    }
private:
    int diameter = 0;
    int maxDepth(TreeNode * root) {
        if (!root) return 0;
        int left = maxDepth(root->left);
        int right= maxDepth(root->right);
        diameter = max(diameter, left + right);
        return max(left, right) + 1;
    }
};