順序儲存和連結儲存的相互轉化

順序儲存轉化為連結儲存：

BTreeNode *create(char* str, int pose, int size) //下標從0開始{ char ch; BTreeNode * t;char* p=str;ch = p[pose];if(ch=='#'|| pose>=size) return NULL; // 表示空結點else { t=(BTreeNode *)malloc(sizeof(BTreeNode)); //非空則構造新結點t->data=ch; //新結點資料域即為讀入字元t->lchild=create(p, 2*pose+1,size); //建立左子樹t->rchild=create(p, 2*pose+2,size); //建立右子樹}return(t);} 

 連結儲存轉化為順序儲存：

 

char a[200];//順序儲存數組int flag;//判斷是否是空樹BiNode* Creat(BiNode *bt,int k){char ch;cin>>ch;if(ch=='#'){bt=NULL;}else{flag=1;bt=new BiNode;bt->data=ch;a[k]=ch;bt->lchild=Creat(bt->lchild,(k)*2);bt->rchild=Creat(bt->rchild,(k)*2+1);}return bt;}

初始化為Creat(root,1);