數據結構基礎算法-二叉樹

#include
#include<stdlib.h>
typedef struct node{
int data;
struct node * right,*left;
}BtNode;


BtNode * PrintBtNode(int a[],int n)
{
BtNode *root,*c,*pa,*p;
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;
while(c)
{
pa=c;
if(c->data>p->data)
c=c->left;
else
c=c->right;
}
if(pa->data>p->data)
pa->left=p;
else
p->right=p;
}
return root;
}
void PrintLink(BtNode *root)
{
for(;root;root=root->left)
printf("%5d",root->data);


}
int main(void)
{
int a[]={3,2,5,8,4,7,6,9,11,25,36,1,8,47};
BtNode *root;
root=PrintBtNode(a,15);
PrintLink(root);
return 0;
}