摘要: Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For 阅读全文
posted @ 2017-02-19 22:48 Pacific-hong 阅读(154) 评论(0) 推荐(0) 编辑
摘要: Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 题意:根据中序遍历和后序 阅读全文
posted @ 2017-02-19 22:00 Pacific-hong 阅读(125) 评论(0) 推荐(0) 编辑