408/CSPostgraduate-408
1
0
Fork 0
mirror of https://github.com/CodePanda66/CSPostgraduate-408.git synced 2023-05-21 21:49:33 +08:00
Code Issues Projects Releases Wiki Activity
Files
1a99a5919f740a0ec32d18e3ac97d84313c751fb
CSPostgraduate-408/408Notes/DataStructure/DS_4_TreeAndBinaryTree/Doc_4_6_二叉树的构造.md
KimYang 1a99a5919f add MindMap
2020-09-26 22:33:18 +08:00

1.4 KiB
Raw Blame History

由先中后序遍历序列构造二叉树

不同二叉树的中序遍历

image-20200805191801166

image-20200805191851595

image-20200805191913602

image-20200805191946368

image-20200805192027276

前+中

image-20200805192120760

后+中

image-20200805202834877

层+中

image-20200805202945647

总结回顾

image-20200805203145525

若前序、后序、层序序列两两组合，是否能确定唯一的一颗二叉树？

答案是：不能，必须有中序序列划分左右子树🌲

Reference in New Issue View Git Blame Copy Permalink