摘要：
iven 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 exam... 阅读全文
posted @ 2015-01-16 21:09
vincently
阅读(231)
评论(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-01-16 20:38
vincently
阅读(315)
评论(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-01-16 19:59
vincently
阅读(305)
评论(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-01-16 19:53
vincently
阅读(244)
评论(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-01-16 19:46
vincently
阅读(309)
评论(0)
推荐(0)
浙公网安备 33010602011771号