该文被密码保护。 阅读全文
posted @ 2015-08-05 10:57 Hygeia 阅读(1) 评论(0) 推荐(0) 编辑
摘要: 题目:Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For ... 阅读全文
posted @ 2015-08-05 10:39 Hygeia 阅读(152) 评论(0) 推荐(0) 编辑
摘要: 题目:Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,... 阅读全文
posted @ 2015-08-05 10:33 Hygeia 阅读(384) 评论(0) 推荐(0) 编辑
摘要: 题目: 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 阅读全文
posted @ 2015-08-05 06:33 Hygeia 阅读(146) 评论(0) 推荐(0) 编辑
摘要: 题目: 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 阅读全文
posted @ 2015-08-05 06:27 Hygeia 阅读(156) 评论(0) 推荐(0) 编辑
摘要: 正确的写法:public static List> function(){ List> list = new ArrayList>(); return list; }错误写法1:public static List> function(){ List>... 阅读全文
posted @ 2015-08-05 05:44 Hygeia 阅读(1600) 评论(0) 推荐(0) 编辑
摘要: 题目: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 andsu... 阅读全文
posted @ 2015-08-05 05:37 Hygeia 阅读(147) 评论(0) 推荐(0) 编辑
摘要: 题目: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... 阅读全文
posted @ 2015-08-02 08:31 Hygeia 阅读(150) 评论(0) 推荐(0) 编辑
摘要: 题目:Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical... 阅读全文
posted @ 2015-08-02 08:15 Hygeia 阅读(102) 评论(0) 推荐(0) 编辑
摘要: 题目:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / ... 阅读全文
posted @ 2015-08-02 08:05 Hygeia 阅读(129) 评论(0) 推荐(0) 编辑