demos/trees.c

   1 #include "cll1.h"
   2
   3 def_mem(Leaf)
   4 {
   5  int value;
   6  array(Leaf);
   7 };
   8
   9 program
  10 {
  11  Leaf leaf,root=NULL;
  12  int newkey;
  13
  14  for_ints(newkey,  8,1,-2,745,-32,-64,27,4 ) printf(" [%d]",i)
  15  {
  16   leaf=get_mem(Leaf);
  17
  18   //init
  19   leaf->__next=NULL;
  20   leaf->__seek=NULL;
  21   leaf->__key=newkey;
  22
  23   //grow tree
  24   {
  25     void *prev = NULL, *newleaf = leaf;
  26     for(leaf=root; leaf && leaf->__key <= newkey ; leaf=leaf->__next)
  27     {
  28      prev = leaf;
  29      if(leaf->__seek && leaf->__seek->key <= newkey) leaf=leaf->__seek;
  30     }
  31
  32     if(prev)
  33     {
  34
  35     }
  36     else
  37     {
  38
  39     }
  40
  41   }
  42  }
  43 }