[leetcode]543. Diameter of Binary Tree

[leetcode]543. Diameter of Binary Tree

---

Analysis

blue~—— [blue~]

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.
问题的关键在于找到圆心，可以参考：https://blog.csdn.net/u012814856/article/details/76212141

Implement

/**
 * 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 diameterOfBinaryTree(TreeNode* root) {
        if(!root)
            return 0;
        inOrder(root);
        int res = INT_MIN;
        for(auto node:tree){
            int sum = 0;
            sum += depth(node->left)+depth(node->right);
            res = max(res, sum);
        }
        return res;
    }
    void inOrder(TreeNode* root){
        if(!root)
            return ;
        inOrder(root->left);
        tree.push_back(root);
        inOrder(root->right);
    }
    int depth(TreeNode* node){
        if(!node)
            return 0;
        return max(depth(node->left), depth(node->right))+1;
    }
private:
    vector<TreeNode*> tree;
};