program
{
Leaf leaf,root=NULL;
+ int newkey;
- for_ints(i, 8,1,-2,745,-32,-64,27,4 ) printf(" [%d]",i)
+ for_ints(newkey, 8,1,-2,745,-32,-64,27,4 ) printf(" [%d]",i)
{
leaf=get_mem(Leaf);
//init
leaf->__next=NULL;
leaf->__seek=NULL;
- leaf->__key=i;
+ leaf->__key=newkey;
//grow tree
- for(leaf=root; leaf && leaf->__key >= i ; leaf=leaf->__next)
+ for(leaf=root; leaf && leaf->__key <= newkey ; leaf=leaf->__next)
{
- if(leaf->__seek->key >=)
- }
-
-
- }
-
+ if(leaf->__seek->key <= newkey)
+ {
+
+ }
+ else
+ {
+
+ }
+ }
+ }
}