[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 ...