[LeetCode] Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

//
// Definition for binary tree
// struct TreeNode {
//     int val;
//     TreeNode *left;
//     TreeNode *right;
//     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
// };
//
class Solution {
public:
    int minDepth(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
       
        // null node
        if(root == NULL){
            return 0;
        }
       
        // get minimum left depth and minmum right depth
        int left = minDepth(root->left);
        int right = minDepth(root->right);
       
        // both of them are bigger than 0
        if(left > 0 && right > 0){
            return (left < right ? left : right) + 1;
        }
        else{
            // at least one of them is 0
            return left + right + 1;
        }
    }
};