1119. Pre- and Post-order Traversals (30)
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and inorder traversal sequences, or preorder and inorder traversal sequences. However, if only the postorder and preorder traversal sequences are given, the corresponding tree may no longer be unique.Suppo
阅读背景：
1119. Pre- and Post-order Traversals (30)-PAT甲级真题（前序后序转中序）
来源：互联网
分享到：
