[LeetCode] 111. 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 ...
原文：[LeetCode] Second Minimum Node In a Binary Tree 二叉树中第二小的结点
Given a non empty special binary tree consisting of nodes with the non negative value, where each node in this tree has exactlytwoorzerosub node. If the node has two sub nodes, then this node s value ...
2017-09-25 05:04 2 5384 推荐指数：
相关推荐
LeetCode：111_Minimum Depth of Binary Tree | 二叉树的最小深度 | Easy
要求：此题正好和Maximum Depth of Binary Tree一题是相反的，即寻找二叉树的最小的深度值：从根节点到最近的叶子节点的距离。 结题思路：和找最大距离不同之处在于：找最小距离要注意(l<r)? l+1:r+1的区别应用，因为可能存在左右子树为空的情况，此时值就为 ...
[LeetCode] 863. All Nodes Distance K in Binary Tree 二叉树距离为K的所有结点
We are given a binary tree (with root node `root`), a `target` node, and an integer value `K`. Return a list of the values of all nodes that have ...
[LeetCode] Closest Leaf in a Binary Tree 二叉树中最近的叶结点
Given a binary tree where every node has a unique value, and a target key k, find the value of the nearest leaf node to target k in the tree ...
二叉树（binary tree）
在写这篇文章之前说一下数据结构和算法这个系列，这个系列包含了很多东西，比如啥子排序，线性表，广义表，树，图这些大家都是知道的，但是这些东西我们学了之后工作中能用到的又有多少呢，据我所知绝大部分公司，一线码农，屌丝，程序猿是用不到这些东西，既然这样为啥子我还要强调这个系列呢，本人觉得算法和数 ...
[LeetCode] 543. Diameter of Binary Tree 二叉树的直径
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path ...
[LeetCode] Print Binary Tree 打印二叉树
Print a binary tree in an m*n 2D string array following these rules: The row number m should be equal to the height of the given binary tree ...
[LeetCode] Binary Tree Tilt 二叉树的坡度
Given a binary tree, return the tilt of the whole tree. The tilt of a tree node is defined as the absolute difference between the sum of all left ...