遍历算法手稿

Word count: 117 | Reading time≈ 1 min

1.中序后序求先序

已知二叉树后序遍历序列是dabec，中序遍历序列是debac，它的前序遍历序列是

已知一棵二叉树前序遍历和中序遍历分别为 ABDEGCFH 和 DBGEACHF，

前序中序与后序中序求二叉树的区别是，前序中序根节点在前序的从前往后-》找

后序中序根节点在后序的从后往前《-找

Copyright： Copyright is owned by the author. For commercial reprints, please contact the author for authorization. For non-commercial reprints, please indicate the source.