leetcode543——Diameter of Binary Tree

题目大意：求二叉树直径（两个叶节点的最大距离）

分析：其实就是dfs求树的深度。直径就是每个节点的左右子树深度加和中的最大值。

代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int diameter = 0;
    int diameterOfBinaryTree(TreeNode* root) {
        dfs(root);
        return diameter;
    }
    int dfs(TreeNode* root){
        if(root == NULL) return 0;
        int leftDepth = dfs(root->left);
        int rightDepth = dfs(root->right);
        diameter = max(diameter,leftDepth + rightDepth);
        return max(leftDepth,rightDepth) + 1;
    }
};