int main(){
add_node(8);
add_node(6);
add_node(10);
add_node(4);
add_node(7);
add_node(9);
add_node(11);
add_node(2);
add_node(5);
printf("\nTree is builded:\n");
print_tree(root);
printf("\nNumbers of Nodes: %d\n",count_num(root));
count = 0;
printf("\nSearch the value: 4\n");
search_node(4);
printf("\nSearch the value: 90\n");
search_node(90);
printf("\ndelete the value: 6\n");
delete_node(6);
printf("\nThe tree is:\n");
print_tree(root);
printf("\nNumbers of Nodes: %d\n",count_num(root));
}
int count_num(Node* leaf){//go over whole tree to compute the number of nodes
if(leaf != NULL)
{
count_num(leaf->left);
count++;
count_num(leaf->right);
}
return count;
}
void myopen(double **num, int *retncnt, double **den, int *retdcnt)
{
char buf[50]={0,};
char dbuf[50]={0,};
int i,ncnt,dcnt;
printf("Insert Numerator\n");
getchar();
fgets(buf,sizeof(buf),stdin);
ncnt = count_num(buf);
*num = (double *)malloc(sizeof(double)*ncnt);
atoiarray(buf,*num,ncnt);
printf("Insert Denomenator\n");
fgets(buf,sizeof(buf),stdin);
dcnt = count_num(buf);
*den = (double *)malloc(sizeof(double)*dcnt);
atoiarray(buf,*den,dcnt);
/*
for(i = 0; i < ncnt; i++)
{
if(i == (ncnt-1))
printf("%.2lf \n",*num[i]);
else
printf("%.2lfs^%d +",*num[i],(ncnt-i-1));
}
printf("----------------------------------------------\n");
for(i = 0; i < dcnt; i++)
{
if(i==(dcnt-1))
printf("%.2lf \n",*den[i]);
else
printf("%.2lfs^%d +",*den[i],(dcnt-i-1));
}
*/
printf("return\n");
*retncnt = ncnt;
*retdcnt = dcnt;
printf("%d %d\n",*retncnt,*retdcnt);
return;
}
int main(void) {
int i = 0, j = 0, num = count_num();
int map[num][num], graph[num][num], tree[num];
memset(map, 0, sizeof(map));
memset(graph, 0, sizeof(graph));
memset(tree, 0, sizeof(tree));
input(num, map);
original(num, map, graph);
foreset(num, tree, graph);
final(num, tree, map, graph);
int main (void) {
int i = 0, j = 0, num = count_num();
int cost[num][num], distance[num][num], record[num][num][2];
memset(cost, 0, sizeof(cost));
memset(distance, 0, sizeof(distance));
memset(record, 0, sizeof(record));
printf("input:\n");
input(num, cost, distance);
printf("\noutput:\n");
all_cost(num, distance, record);
output(num, distance, record);
return 0;
}
int main(int argc, char *argv[])
{
int rtval = -1, i;
int start, end, key;
int array[MAX_LEN];
memset(array, 0, MAX_LEN);
fprintf(stdout, "Please input three numbers: \n");
scanf("%d%d%d", &start, &end, &key);
rtval = count_num(start, end, key, array);
if (rtval < 0)
{
fprintf(stdout, "Parameter error!\n");
}
else
{
fprintf(stdout, "%d ~ %d has %d numbers of %d\n", start, end, rtval, key);
}
for (i = 0; i < rtval; i++)
{
fprintf(stdout, "%d ", array[i]);
}
putchar('\n');
return 0;
}
