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

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

在写这篇文章之前说一下数据结构和算法这个系列，这个系列包含了很多东西，比如啥子排序，线性表，广义表，树，图这些大家都是知道的，但是这些东西我们学了之后工作中能用到的又有多少呢，据我所知绝大部分公司，一线码农，屌丝，程序猿是用不到这些东西，既然这样为啥子我还要强调这个系列呢，本人觉得算法和数 ...

Invert a binary tree. to Trivia: This problem was inspired by this original tweet by Max Howell: Google: 90% of our engineers use ...

Given a binary tree, return the values of its boundary in anti-clockwise direction starting from root. Boundary includes left boundary, leaves ...

们一个二叉树，让我们返回所有根到叶节点的路径，跟之前那道Path Sum II很类似，比那道稍微简单一些， ...

Given a binary tree, return the values of its boundary in anti-clockwise direction starting from root. Boundary includes left boundary ...

Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: The root is the maximum number ...