摘要： Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return 用的比价暴力的方法， 也是最快的。 阅读全文

摘要： Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would your previous solution sti 阅读全文

摘要： Given a binary tree Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL 阅读全文

摘要： Given a binary tree, flatten it to a linked list in-place. For example,Given The flattened tree should look like: 这道题就是将数变为只有右节点的树。 递归，不是很难。 递归的时候求出左节 阅读全文

摘要： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree and sum 阅读全文

摘要： Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. F 阅读全文

摘要： 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 to the nearest l 阅读全文

摘要： Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the dept 阅读全文

摘要： Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 和上一题类似，把数组换成链表，所以可以两种做法： 1、把链表换成数组，然后用上一 阅读全文

摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 给一个排好序的数组，然后求搜索二叉树 其实就是二分法，不难。 阅读全文