非递归构造二叉查找树

我写的非递归构造二叉查找树的算法

#include<stdio.h>;
#include<stdlib.h>;
typedef struct Search_Tree
{
 int key;
 struct Search_Tree *right;
 struct Search_Tree *left;
}Search_Node;
Search_Node* Build_SearchTree(int n)
{
int i;
Search_Node *root=NULL;
Search_Node *p,*q;
int key;
for(i=0;i<n;i++)
{
key=rand();
if(root==NULL)
{
root=(Search_Node*)malloc(sizeof(Search_Node));
root->key=key;
root->right=NULL;
root->left=NULL;
q=root;
}
else{
q=root;
p=(Search_Node*)malloc(sizeof(Search_Node));
while(q->left!=p&&q->right!=p)
{
while(key<=q->key)
{
if(q->left==NULL)
{
q->left=p;
p->key=key;
p->left=NULL;
p->right=NULL;
break;
}
else
{
q=q->left;
}
}
while (key>q->key)
{
if(q->right==NULL)
{
q->right=p;
p->key=key;
p->left=NULL;
p->right=NULL;
break;
}
else
{
q=q->right;
}
}

}
}
}
return root;
}
void Print_SearchTree(Search_Node* root)
{
 Search_Node *p;
 p=root;
 if(p==NULL)
 {
  printf("NULL/n");
 }
 else{
  printf("%d/n",p->key);
     if(p->left!=NULL)Print_SearchTree(p->left);
  else if(p->right!=NULL)Print_SearchTree(p->right);
 }
}
//中序遍历打印算法
void PrintTree(Search_Node* root)
{
   if(root!=NULL)
   {
      PrintTree(root->left);
      printf("%d/n",root->key);
      PrintTree(root->right);
   } 
}
main()
{
int i;
Search_Node *rt;
rt=Build_SearchTree(10);
PrintTree(rt);
}