Given a binary tree, collect a tree s nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example: Explanation: . Removing the leaves , , would result in t ...
2016-06-25 12:34 2 13095 推荐指数：
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 ...
Given a binary tree with the following rules: root.val == 0 If treeNode.val == x and treeNode.left != null, then treeNode.left.val == 2 * x ...
地址 https://leetcode-cn.com/contest/weekly-contest-163/problems/find-elements-in-a-contaminated-binary-tree/ 题目描述给出一个满足下述规则的二叉树： root.val ...
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia ...
In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1. Two nodes of a binary tree are cousins ...
在写这篇文章之前说一下数据结构和算法这个系列，这个系列包含了很多东西，比如啥子排序，线性表，广义表，树，图这些大家都是知道的，但是这些东西我们学了之后工作中能用到的又有多少呢，据我所知绝大部分公司，一 ...
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 ...
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 ...
