[LeetCode] Minimum Depth of Binary Tree

来源:互联网 发布:ubuntu wine 使用 编辑:程序博客网 时间:2024/06/06 06:33
class Solution {public:    int minDepth(TreeNode *root) {        if(root ==  NULL)            return 0;        if(root -> left == NULL)            return minDepth(root -> right) + 1;        if(root -> right == NULL)            return minDepth(root -> left) + 1;        return min((minDepth(root -> left) + 1),(minDepth(root -> right) + 1));    }};

0 0