已知某二叉树的中根遍历序列是ABCDEFG,后根遍历序列是BDCAFGE,则它的先跟遍历序列是:EACBDGF
首先明确先跟遍历:中左右;中根遍历:左中右;后根遍历:左右中
1.后根遍历明确根节点是E,中根遍历确定左子树是ABCD,右子树上是FG
~~~~~~~~~~~E
~~~~~~~~~~/~\
~~~~~(BDCA)(FG)
2.后序遍历,A是左子树的根,然后在中序里ABCD判断A没有左子树:
~~~~~~~~~~E
~~~~~~~~~/~\
~~~~~~~~A (FG)
~~~~~~~~~\
~~~~~~~~(BDC)
3.同2可得 左子树:(F不知左右)
~~~~~~~~~~~ E
~~~~~~~~~~/ \
~~~~~~~~~A G
~~~~~~~~~~\ |
~~~~~~~~~~~C F
~~~~~~~~~~/~\
~~~~~~~~~B~~~D
4.根据GF中序序列所知F应该为G的左节点:
~~~~~~~~~~~ E
~~~~~~~~~~/~ \
~~~~~~~~~A~~~ G