摘要：
Problem LeetCode Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: The root is the maximum number 阅读全文
摘要：
Problem LeetCode Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 1 / \ 2 5 / \ \ 3 4 6 The flattened 阅读全文
摘要：
Problem LeetCode You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has th 阅读全文