二插排序树（自己实现）

#include<iostream>
#include<vector>
using namespace std;
#define Elemtype int
typedef struct node
{
Elemtype data;
node* left_node;
node* right_node;
}node;
void insert(node*& root,Elemtype elem)//由一个根节点去递归的生长子树
{
node* temp=(node*)malloc(sizeof(node));
temp->data = elem;
temp->left_node = NULL;
temp->right_node = NULL;
if (root == NULL)
root = temp;
else
{
if (root->data > elem && (root->left_node == NULL))
{
root->left_node = temp;
}
if (root->data < elem && (root->right_node == NULL))
{
root->right_node = temp;
}
if (root->data>elem && (root->left_node != NULL))
{
insert(root->left_node, elem);
}
if (root->data < elem && (root->right_node != NULL))
{
insert(root->right_node, elem);
}
}
}
void make_bst(node*& root,vector<Elemtype>& v)
{
for (int i = 0; i < v.size(); i++)
{
insert(root, v[i]);//一个结点一个结点的去生长（插入）
}
}
int main()
{
int n;
node* root=NULL;//此时是空节点
vector<Elemtype> v;
cout << "input n" << endl;
cin >> n;
cout << "input nums" << endl;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
v.push_back(temp);
}
make_bst(root, v);
return 0;
}