Level Order的各种变形题目

N-ary tree pre/in/post order traversal
Construct a tree from (pre/in, in/post, pre/post) order
Verify Preorder serialization of a binary tree.
Verify Preorder sequence in BST
recover a tree from preorder/inorder/postorder traversal
Flip binary tree to match preorder/inorder/postorder traversal