摘要：
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 exa... 阅读全文
posted @ 2015-07-27 22:34
amazingzoe
阅读(129)
评论(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,9,2... 阅读全文
posted @ 2015-07-27 22:00
amazingzoe
阅读(216)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].No... 阅读全文
posted @ 2015-07-27 16:17
amazingzoe
阅读(148)
评论(0)
推荐(0)
摘要：
Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note... 阅读全文
posted @ 2015-07-27 13:25
amazingzoe
阅读(131)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].Not... 阅读全文
posted @ 2015-07-27 12:05
amazingzoe
阅读(128)
评论(0)
推荐(0)
浙公网安备 33010602011771号