LeetCode/111.cpp at master · nitin-maharana/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
52
53
54
55
56
57
58
59
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

/**
 * 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 minDepth(TreeNode* root) {
        if(!root)
            return 0;

        if(root->left && root->right)
            return min(minDepth(root->left)+1, minDepth(root->right)+1);
        else if(root->left)
            return minDepth(root->left)+1;
        else
            return minDepth(root->right)+1;
    }
};

class Solution1 {
    int minimumDepth;
public:
    void minDepth(TreeNode* root, int depth)
    {
        if(!root->left && !root->right)
        {
            if(depth < minimumDepth)
                minimumDepth = depth;

            return;
        }

        if(root->left)
            minDepth(root->left, depth+1);

        if(root->right)
            minDepth(root->right, depth+1);
    }

    int minDepth(TreeNode* root) {
        if(!root)
            return 0;

        minimumDepth = INT_MAX;
        minDepth(root, 1);
        return minimumDepth;
    }
};