摘要：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: But the fol 阅读全文
posted @ 2014-10-26 10:49
Grandyang
阅读(17420)
评论(17)
推荐(2)
摘要：
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 阅读全文
posted @ 2014-10-26 07:32
Grandyang
阅读(22261)
评论(9)
推荐(0)
摘要：
Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf 阅读全文
posted @ 2014-10-26 05:23
Grandyang
阅读(14022)
评论(1)
推荐(0)
摘要：
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 tree {3 阅读全文
posted @ 2014-10-26 04:57
Grandyang
阅读(28991)
评论(11)
推荐(2)
