***二叉搜索树***的结构,首先是一个二叉树,特点是小的元素放在左边,大的元素放在右边。代码如下
#include<stdio.h>
#include<stdlib.h>
typedef struct node {
struct node *left;
struct node *right;
int data;
} Node;
typedef struct tree {
Node *root;
} Tree;
void insert(Tree *tree, int value)
{
Node *node = (Node *)malloc(sizeof(Node));
node->data = value;
node->left = NULL;
node->right = NULL;
if( tree->root == NULL )
{
tree->root = node;
}
else
{
Node