이진트리삽입삭제문제...

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
#include <time.h>
 
typedef struct TreeNode{
	int key;
	struct TreeNode *left,*right;
}TreeNode;
 
void insertNode(TreeNode *root, int key)
{
 
 
	TreeNode *p, *t;
	TreeNode *n,*succ;
 
	t=root;
	p=NULL;
 
	if(root)
	{
	insertNode(root->left ,key);
	while(t!=NULL)
	{
		if(key == t->key) return;
		p=t;
		if(key<p->key) 
			t=p->left;
		else 
			t=p->right;
	}
	n = (TreeNode*)malloc(sizeof(TreeNode));
	if(n==NULL) return;
	n->key = key;
	n->left = n->right = NULL;
	if(p!=NULL)
		if(key<p->key)
			p->left=n;
		else
			p->right=n;
	else root = n;
	insertNode(root->right ,key);
	}
}
 
void deleteNode(TreeNode *root, int key)
{
	TreeNode *p, *child, *succ, *succ_p, *t;
	p=NULL;
	t=root;
 
	if(root)
	{
	deleteNode(root->left,key);
	deleteNode(root->right,key);
	while(t!=NULL && t->key != key)
	{
		p=t;
		t=(key < p->key)? p->left : p->right;
	}
	if(t==NULL)
	{
		printf("찾고자하는 Key가 이진 트리에 없습니다.");
		return;
	}
	if((t->left==NULL)&&(t->right==NULL))
	{
		if(p!=NULL){
			if(p->left == t)
				p->left=NULL;
			else
				p->right=NULL;
		}
		else
			root=NULL;
	}
	else if((t->left==NULL)||(t->right=NULL))
	{
		child=(t->left!=NULL) ? t->left:t->right;
		if(p!=NULL)
		{
			if(p->left==t)
				p->left=child;
			else
				p->right=child;
		}
		else
			root=child;
	}
	else
	{
		succ_p=t;
		succ=t->right;
		while(succ->left!=NULL)
		{
			succ_p=succ;
			succ=succ->left;
		}
		if(succ_p->left==succ)
			succ_p->left=succ->right;
		else
			succ_p->right=succ->right;
		t->key = succ->key;
		t=succ;
	}
	free(t);
	}
}
 
void displayNode(TreeNode *root)
{
if(root!=NULL)
{
	displayNode(root->left);
	printf("%d ",root->key);
	displayNode(root->right);
}
}
 
int main()
{
int *n,i,r;
TreeNode *root = NULL;
srand((unsigned)time(NULL));
n = (int*)malloc(100*sizeof(int));
for(i=0; i<100; i++)
{
	r=(rand()%100)+1;
	n[i]=r;
	insertNode(root,n[i]);
}
displayNode(root);
}