摘要：
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). （Eas 阅读全文
摘要：
Given inorder and postorder traversal of a tree, construct the binary tree. （Medium） Note:You may assume that duplicates do not exist in the tree. 分析： 阅读全文
摘要：
Given preorder and inorder traversal of a tree, construct the binary tree. （Medium） Note:You may assume that duplicates do not exist in the tree. 分析： 阅读全文
摘要：
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 farthest l 阅读全文
摘要：
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). （Easy） For example:Given binary 阅读全文
摘要：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). （Easy） For example, this binary tree [1,2,2,3,4,4,3] is 阅读全文