2、minimum-depth-of-binary-tree

最新推荐文章于 2021-03-26 11:04:55 发布

sinat_16985427

最新推荐文章于 2021-03-26 11:04:55 发布

阅读量217

点赞数

分类专栏： leetcode-数据结构

本文链接：https://blog.csdn.net/sinat_16985427/article/details/54948299

版权

leetcode-数据结构专栏收录该内容

2 篇文章 0 订阅

订阅专栏

题目描述

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.

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

运行结果: