13 for (i=1 ; i < 10 ; i++)
15 arr[i]= fh_insertkey(a,0,(void *)i);
16 printf("adding: 0 %d \n",i);
20 fh_replacekey(a, arr[1],-1);
21 fh_replacekey(a, arr[6],-1);
22 fh_replacekey(a, arr[4],-1);
23 fh_replacekey(a, arr[2],-1);
24 fh_replacekey(a, arr[8],-1);
26 printf("value(minkey) %d\n",fh_minkey(a));
27 printf("id: %d\n\n", (int)fh_extractmin(a));
29 fh_replacekey(a, arr[7],-33);
30 /* -> node 7 becomes root node, but is still pointed to by node 6 */
31 fh_replacekey(a, arr[4],-36);
32 fh_replacekey(a, arr[3],-1);
33 fh_replacekey(a, arr[9],-81);
35 printf("value(minkey) %d\n",fh_minkey(a));
36 printf("id: %d\n\n", (int)fh_extractmin(a));
38 fh_replacekey(a, arr[6],-68);
39 fh_replacekey(a, arr[2],-69);
41 printf("value(minkey) %d\n",fh_minkey(a));
42 printf("id: %d\n\n", (int)fh_extractmin(a));
44 fh_replacekey(a, arr[1],-52);
45 fh_replacekey(a, arr[3],-2);
46 fh_replacekey(a, arr[4],-120);
47 fh_replacekey(a, arr[5],-48);
49 printf("value(minkey) %d\n",fh_minkey(a));
50 printf("id: %d\n\n", (int)fh_extractmin(a));
52 fh_replacekey(a, arr[3],-3);
53 fh_replacekey(a, arr[5],-63);
55 printf("value(minkey) %d\n",fh_minkey(a));
56 printf("id: %d\n\n", (int)fh_extractmin(a));
58 fh_replacekey(a, arr[5],-110);
59 fh_replacekey(a, arr[7],-115);
61 printf("value(minkey) %d\n",fh_minkey(a));
62 printf("id: %d\n\n", (int)fh_extractmin(a));
64 fh_replacekey(a, arr[5],-188);
66 printf("value(minkey) %d\n",fh_minkey(a));
67 printf("id: %d\n\n", (int)fh_extractmin(a));
69 fh_replacekey(a, arr[3],-4);
71 printf("value(minkey) %d\n",fh_minkey(a));
72 printf("id: %d\n\n", (int)fh_extractmin(a));
74 printf("value(minkey) %d\n",fh_minkey(a));
75 printf("id: %d\n\n", (int)fh_extractmin(a));