LeetCode-543. 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:
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.

题解：

注意返回值和答案的区别，返回值是当前路径左右最大值，答案是比较当前答案和左右最长路径和。

class Solution {
public:
    int getHeight(TreeNode *root, int &res) {
        if (root != NULL) {
            int left = getHeight(root->left, res);
            int right = getHeight(root->right, res);
            res = max(res, left + right);
            return 1 + max(left, right);
        }
        return 0;
    }
    int diameterOfBinaryTree(TreeNode* root) {
        int res = 0;
        getHeight(root, res);
        return res;
    }
};