2015 年 10月 22 日随笔档案 - 怕忘记

摘要： 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-10-22 21:57 怕忘记阅读(219) 评论(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]. 1 ... 阅读全文

posted @ 2015-10-22 21:22 怕忘记阅读(132) 评论(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]. 1... 阅读全文

posted @ 2015-10-22 21:09 怕忘记阅读(117) 评论(0) 推荐(0) 编辑

导航