2014年11月10日
LeetCode Construct Binary Tree from Inorder and Postorder Traversal
摘要： 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 @ 2014-11-10 23:29 birdhack 阅读(112) 评论(0) 推荐(0)