16 print("Input values:");
17 for_ints(newkey
, 8,1,-2,745,-32,-64,27,4,-300,0,300,40,-30,-40,400, 200 )
19 printf("%d. [%d]\n",seq
,newkey
);
24 //store(leaf,root,newkey) is declared as:
31 //store new node without indexing, first
32 insert(leaf
,root
,order_by_num
,__key
);
35 for(leaf
=root
;leaf
->__next
;leaf
=leaf
->__next
)
38 if(!leaf
->__seek
&& leaf
->__next
)
39 leaf
->__seek
=leaf
->__next
->__next
;
41 if(leaf
->__key
<=newkey
)
43 if(leaf
->__seek
&& leaf
->__seek
->__key
>newkey
) leaf
->__seek
=leaf
->__seek
->__next
;
47 if(odd
&& leaf
->__seek
)
49 leaf
->__seek
==leaf
->__seek
->__next
;
53 leaf
->__seek
=leaf
->__next
->__seek
;
54 leaf
->__next
->__seek
=NULL
;
61 print("Values were stored as:");
64 printf("%d. [%d]",leaf
->seq
,leaf
->__key
);
66 printf("-> %d. [%d]\n",leaf
->__seek
->seq
,leaf
->__seek
->__key
);
This page took 0.296817 seconds and 4 git commands to generate.