leetcode算法题--Minimum Depth of Binary Tree

原题链接：https://leetcode.com/problems/minimum-depth-of-binary-tree/

int minDepth(TreeNode* root) {if (root == NULL) return 0;int left = minDepth(root->left);int right = minDepth(root->right);if (!left || !right) return left + right + 1;return min(left, right) + 1;
}

leetcode算法题--Minimum Depth of Binary Tree相关推荐

LeetCode算法题-Minimum Depth of Binary Tree（Java实现）
这是悦乐书的第168次更新,第170篇原创 01 看题和准备今天介绍的是LeetCode算法题中Easy级别的第27题(顺位题号是111).给定二叉树,找到它的最小深度.最小深度是沿从根节点到最近的 ...
LeetCode： 111. Minimum Depth of Binary Tree
题目 Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced bina ...
LeetCode:Minimum Depth of Binary Tree,Maximum Depth of Binary Tree
LeetCode:Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum depth ...
【LeetCode】Minimum Depth of Binary Tree 二叉树的最小深度 java
[LeetCode]Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum dept ...
leetcode - Minimum Depth of Binary Tree
题目:Minimum Depth of Binary Tree Given a binary tree, find its minimum depth. The minimum depth is th ...
LeetCode刷题记录14——257. Binary Tree Paths（easy）
LeetCode刷题记录14--257. Binary Tree Paths(easy) 目录前言题目语言思路源码后记前言数据结构感觉理论简单,实践起来很困难. 题目给定一个二叉树, ...
【LeetCode】104. Maximum Depth of Binary Tree (2 solutions)
Maximum Depth of Binary Tree Given a binary tree, find its maximum depth. The maximum depth is the ...
C#LeetCode刷题之#111-二叉树的最小深度（Minimum Depth of Binary Tree）
问题给定一个二叉树,找出其最小深度. 最小深度是从根节点到最近叶子节点的最短路径上的节点数量. 说明: 叶子节点是指没有子节点的节点. 给定二叉树 [3,9,20,null,null,15,7], ...
leetcode python3 简单题111. Minimum Depth of Binary Tree
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百一十一题 (1)题目英文: Given a binary tree, fin ...

leetcode算法题--Minimum Depth of Binary Tree

leetcode算法题--Minimum Depth of Binary Tree相关推荐

最新文章

热门文章