LeetCode/diameterOfBinaryTree.c at master · LinusMelb/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

int m = 0;

int diameterOfBinaryTree(struct TreeNode* root) {

    if(root != NULL){

        int l = f_path(root->left);
        int r = f_path(root->right);

        if(l + r > m){
            m = l + r;
        }
        return m;

    }
    return 0;

}

int f_path(struct TreeNode* node){

    if(node != NULL){
        int lpath = f_path(node->left);
        int rpath = f_path(node->right);

        int maxp = (lpath>rpath?lpath:rpath) + 1;

        if(lpath + rpath > m){
            m = lpath + rpath;
        }

        return maxp;
    }

    return 0;
}

int main(int argc, char const *argv[])
{

    return 0;
}