LeetCode:Minimum Depth of Binary Tree

Minimum Depth of Binary Tree

Total Accepted: 81059 Total Submissions: 274649 Difficulty: Easy

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.

Subscribe to see which companies asked this question












code:

/**
 * 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;
        int l = minDepth(root->left);
        int r = minDepth(root->right);
        
        if(0==l) return r+1;
        else if(0==r) return l+1;
        else return min(l,r) + 1;
    }
};


阅读更多
版权声明:本文为博主原创文章,转载请注明出处。 https://blog.csdn.net/itismelzp/article/details/49952847
个人分类: LeetCode OJ
所属专栏: LeetCode解题记录
上一篇LeetCode:Reverse Integer
下一篇LeetCode:Rectangle Area
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭