学算法的时候自己写的
#include<stdio.h>
#include<stdlib.h>
typedef struct Node
{
int key;
struct Node* right;
struct Node* left;
}BSearchNode;
//-------------------------------------------------------
BSearchNode* Initial()
{
BSearchNode* root;
root=(BSearchNode*)malloc(sizeof(BSearchNode));
root->key=rand();
root->left=NULL;
root->right=NULL;
return root;
}
//-------------------------------------------------------
void InsertNode(BSearchNode* root,int n)
{
if(root==NULL)
{
printf("error!");
}
if(n<=root->key)
{
if(root->left)
{
InsertNode(root->left,n);
}
else
{
BSearchNode* p=(BSearchNode*)malloc(sizeof(BSearchNode));
root->left=p;
p->key=n;
p->left=NULL;
p->right=NULL;
//这里的return应该是可以直接跳出整个递归程序的
return;
}
}
if(n>root->key)
{
if(root->right)
{
InsertNode(root->right,n);
}
else
{
BSearchNode* p=(BSearchNode*)malloc(sizeof(BSearchNode));
root->right=p;
p->key=n;
p->left=NULL;
p->right=NULL;
return;
}
}
}