![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode-数据结构
sinat_16985427
这个作者很懒,什么都没留下…
展开
-
1、binary-tree-postorder-traversal
题目描述点击打开链接 :https://www.nowcoder.com/practice/32af374b322342b68460e6fd2641dd1b?tpId=46&tqId=29035&tPage=1&rp=1&ru=/ta/leetcode&qru=/ta/leetcode/question-rankingGiven a binary tree, return the post原创 2017-02-09 15:48:59 · 215 阅读 · 0 评论 -
2、minimum-depth-of-binary-tree
题目描述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: i原创 2017-02-09 16:06:38 · 210 阅读 · 0 评论 -
LeetCode:104_Maximum Depth of Binary Tree | 二叉树的最大深度 | Easy
要求:求二叉树的深度(二叉树的深度为最远叶子节点到根节点的距离,即根节点到最远叶子节点的距离)Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest原创 2017-02-12 21:01:43 · 191 阅读 · 0 评论