leetcode-1-Minimum Depth of Binary Tree

最新推荐文章于 2024-10-18 22:48:33 发布

dangcingDNA

最新推荐文章于 2024-10-18 22:48:33 发布

阅读量184

点赞数 1

分类专栏： code 文章标签： c++

本文链接：https://blog.csdn.net/u014161456/article/details/77884980

版权

code 专栏收录该内容

1 篇文章 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;
int n_left = run(root->left);
int n_right = run(root->right);
if (n_left==0||n_right==0)
return 1+n_left+n_right;
return n_left