創建二叉樹( 二叉排序樹(Binary Sort Tree))
阿新 • • 發佈:2018-08-07
sort data scanf urn pre [] print 二叉樹 str #include<stdio.h>
#include<stdlib.h>
/*
遞歸前中後遍歷
*/
typedef struct node
{
int data;
struct node*left;
struct node*right;
}BTnode;
BTnode*CreateTree(int a[],int n)
{
BTnode*root,*c,*p,*pa;
int i;
root=(BTnode*)malloc(sizeof(BTnode));
root->data=a[0];
root->left=root->right=NULL;//建立根節點
for(i=1;i<n;i++){
p=(BTnode*)malloc(sizeof(BTnode));
p->data=a[i];
p->left=p->right=NULL;
c=root; //根節點給C指針
while(c){ //判斷p結點時屬於左子樹還是右子樹
pa=c; //pa指針是p結點的父節點
if(c->data>p->data)
c=c->left;
else
c=c->right;
}
if(pa->data>p->data) //p結點時父節點的左孩子還是右孩子
pa->left=p;
else
pa->right=p;
}
return root;
}
void Forder(BTnode*root){
if(root){
printf("%d",root->data);
printf("\n");
Forder(root->left);
Forder(root->right);
}
}
void Inorder(BTnode*root){
if(root){
Inorder(root->left);
printf("%3d",root->data);
printf("\n");
Inorder(root->right);
}
}
void Porder(BTnode*root){
if(root){
Porder(root->left);
Porder(root->right);
printf("%6d",root->data);
printf("\n");
}
}
int main(void){
BTnode*root;
int *a;
int n;
int i;
printf("請輸入n=");
scanf("%d",&n);
a=(int*)malloc(n*sizeof(int));
printf("請輸入數組a[]=");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
root=CreateTree(a,n);
Forder(root);
Inorder(root);
Porder(root);
}
創建二叉樹( 二叉排序樹(Binary Sort Tree))