arbcharch由前序和中序得到便于建立二叉树的新序列i
ti0j0k0ARRAYm
fori0i49i
mAi0
Ai0mBi0
Bi0kle
gthchifle
gtha0字符串长度为1的情况
chkifle
gtha1字符串长度为1的情况
chka0chkchkelseifle
gtha2字符串长度为2的情况
chka0ifa0b0
chkchka1ifa0b1
chka1chk
fchkchkelseifle
gtha3字符串长度为3的情况chka0ifa0b1
chka1chkchkchka2elseifa0b0
chkifa1b1
chka1chkchka2elseifa1b2
chka1chka2chkelseifa0b2ifa1b0
chka1chkchka2chkelseifa1b1
chka1chka2chkchkchkchkelseifle
gtha4chka0forj0jifa0bj
fori0iji
fmAiai1mBibi

forijile
gtha1i

ifai10

Aijai1
Bijbi1

break


Buildi
gmAmBch递归调用
Buildi
g
A
Bch
递归调用


voidCreatTreeTreeTcharch1建立二叉树

ifch1
TNULL
else

TNODEmallocsizeofNODE
Tdatach1
CreatTreeTlcPopq
CreatTreeTrcPopq


voidPostorderTreeBT
后序遍历

ifBTNULL

PostorderBTlc
PostorderBTrc
pri
tf