The paper generalizes two methods of reducing binary tree by preorder traversal and inoder traversal or inorder traversal and endorder traversal.

• 概括出由前序、中序或中序、后序遍历结果还原二叉树的两种方法。