.按层次遍历第一个结点(若树不空)为根该结点在中序序列中把序列分成左右两部分左子树和右子树若左子树不空层次序列中第二个结点左子树的根若左子树为空则层次序列中第二个结点右子树的根对右子树也作类似的分析层次序列的特点是从左到右每个结点或是当前情况下子树的根或是叶子
.森林的先序序列和后序序列对应其转换的二叉树的先序序列和中序序列应先据此构造二叉树再构造出森林
[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []