111. Minimum Depth of Binary Tree
来源：互联网 发布：无法更改mac地址 编辑：程序博客网 时间：2024/06/07 03:27
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.
/** * 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 min = 0x7fffffff; void dfs(TreeNode* root, int level){ if(root == NULL) return; if(root->left == NULL && root->right == NULL){ min = level < min ? level : min; return; } dfs(root->left, level + 1); dfs(root->right, level + 1); } int minDepth(TreeNode* root) { if(root == NULL) return 0; dfs(root, 1); return min; }}; 0 0
- LeetCode 111. Minimum Depth of Binary Tree
- [LeetCode]111.Minimum Depth of Binary Tree
- 【LeetCode】111.Minimum Depth of Binary Tree
- [Leetcode] 111. Minimum Depth of Binary Tree
- 111.Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- [leetcode] 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree LeetCode
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 【LeetCode】111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- LeetCode *** 111. Minimum Depth of Binary Tree
- 111. Minimum Depth of Binary Tree
- 微信小应用资源汇总整理
- 前端自动化管理工具grount
- c
- Java中的线程池
- HCIE知识整理：ospf 的 virtual-link 有哪些用途，在用的时候可能会有什么问题，解决方案是 什么？
- 111. Minimum Depth of Binary Tree
- oracle分区之包含模板的'范围-列表分区'例子
- 哈理工OJ 1394 XianGe的游戏I（水题么？）
- 从上往下打印二叉树
- mac上用终端启动和关闭mysql服务
- Redis 源码阅读笔记1：zmalloc
- 关于canvas 画布
- cocos2d-x坑的集合
- leetcode 461 hammingDistance
