2019年5月22日
[LeetCode] 889. Construct Binary Tree from Preorder and Postorder Traversal 由先序和后序遍历建立二叉树
摘要： Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals and are distinct positive integers. Example 阅读全文
posted @ 2019-05-22 23:10 Grandyang 阅读(4085) 评论(2) 推荐(1) 编辑
Fork me on GitHub