LeetCode 之 111. 二叉树的最小深度

class Solution(object):
    def minDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root:
            if not root.left and root.right:
                return 1 + self.minDepth(root.right)
            elif not root.right and root.left:
                return 1 + self.minDepth(root.left)
            else:
                return min(self.minDepth(root.left), self.minDepth(root.right)) + 1
        else:
            return 0

class Solution {
public:
    int minDepth(TreeNode* root) {        
        if(root == NULL){
            return 0;
        }
        else{
            if(root->left == NULL && root->right != NULL){
                return 1 + minDepth(root->right);
            }
            else if(root->right == NULL && root->left != NULL){
                return 1 + minDepth(root->left);
            }
            else{
                return min(minDepth(root->left), minDepth(root->right)) + 1; 
            }
        }
    }
};