binary_search_tool/full_bisect_test/build.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

#include <stdlib.h>
#include "bin-trees.h"

tree_ptr
new_node (int value)
{
  tree_ptr node = (tree_ptr) malloc (sizeof (tree_ptr));
  node->data = value;
  node->left = NULL;
  node->right = NULL;
  return node;
}

void
search_tree_insert (tree_ptr *root, int value)
{
  if (*root == NULL)
    *root = new_node (value);
  else if (value < (*root)->data)
    search_tree_insert (&((*root)->left), value);
  else if (value > (*root)->data)
    search_tree_insert (&((*root)->right), value);
}