408/2021-Postgraduate-408
1
0
Fork 0
mirror of https://github.com/hao14293/2021-Postgraduate-408.git synced 2026-02-02 18:20:30 +08:00
Code Issues Projects Releases Wiki Activity

Create 由先序中序建立二叉树.cpp

Browse Source
This commit is contained in:
hao14293
2019-07-25 16:02:09 +08:00
committed by GitHub
parent b0917712fc
commit fe9efd6ea2
1 changed files with 18 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
DailySummary/由先序中序建立二叉树.cpp Normal file
View File

@@ -0,0 +1,18 @@
BiTree PreInCreat(ElemType A[], ElemType B[], int l1, int h1, int l2, int h2){
//初始调用 l1 = l2 = 1, h1 = h2 = n;
root = (BiTNode*)malloc(sizeof(BiTNode));
root->data = A[l1];
for(int i = l2; B[i] != root->data; i++);
llen = i - l2;
rlen = h2 - i;
if(llen)
root->lchild = PreInCreat(A, B, l1 + 1, l1 + llen, l2, l2 + llen - 1);
else
root->lchild = NULL;
if(rlen)
root->rchild = PreInCreat(A, B, h1 - rlen + 1, h1, h2 - rlen + 1, h2);
else
root->rchild = NULL;
return root;
}