关闭

LeetCode:Minimum Depth of Binary Tree

标签: LeetCodeMinimum Depth of Bin
235人阅读 评论(0) 收藏 举报
分类:

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;
    }
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:338850次
    • 积分:6277
    • 等级:
    • 排名:第4057名
    • 原创:312篇
    • 转载:1篇
    • 译文:0篇
    • 评论:23条
    博客专栏
    最新评论