摘要：
题目： 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 neare 阅读全文
摘要：
题目： 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 阅读全文
摘要：
题目： Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 链接： http://leetcode.com/problems/con 阅读全文
摘要：
题目： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 链接： http://leetcode.com/problems/convert-sorted- 阅读全文
摘要：
题目： Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). 阅读全文
摘要：
题目： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 链接： http 阅读全文
摘要：
题目： Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 链接： http: 阅读全文
摘要：
题目： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthe 阅读全文
摘要：
题目： Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level 阅读全文
摘要：
题目： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tre 阅读全文