16 for_ints(newkey
, 8,1,-2,745,-32,-64,27,4 )
18 printf("%d. [%d]\n",seq
,newkey
);
30 void *prev
=NULL
, *newleaf
=leaf
;
32 for(leaf
=root
;leaf
&& leaf
->__key
<=newkey
;leaf
=leaf
->__next
)
35 if(leaf
->__seek
&& leaf
->__seek
->key
<=newkey
)
44 leaf
->__next
=prev
->__next
->__next
;
51 for(leaf
=root
;leaf
->__next
;leaf
=leaf
->__next
)
55 leaf
->__seek
=leaf
->__next
->__next
;
57 if(leaf
->__key
<=newkey
)
59 if(leaf
->__seek
&& leaf
->__seek
->__key
>newkey
)
60 leaf
->__seek
=leaf
->__seek
->__next
;
64 if(odd
&& leaf
->__seek
)
66 leaf
->__seek
==leaf
->__seek
->__next
;
71 leaf
->__seek
=leaf
->__next
->__seek
;
72 leaf
->__next
->__seek
=NULL
;
81 printf("%d. [%d]\n",leaf
->seq
,leaf
->__key
);
This page took 0.814431 seconds and 4 git commands to generate.