61,7 → 61,7 |
if (node->lft) { |
tmp = test_tree_parents(node->lft); |
if (tmp != node) { |
printf("Bad parent pointer key: %d, address: %p\n", |
printf("Bad parent pointer key: %" PRIu64 ", address: %p\n", |
tmp->key, node->lft); |
} |
} |
68,7 → 68,7 |
if (node->rgt) { |
tmp = test_tree_parents(node->rgt); |
if (tmp != node) { |
printf("Bad parent pointer key: %d, address: %p\n", |
printf("Bad parent pointer key: %" PRIu64 ", address: %p\n", |
tmp->key,node->rgt); |
} |
} |
109,7 → 109,7 |
if (node == NULL) |
return; |
|
printf("%d[%d]", node->key, node->balance); |
printf("%" PRIu64 "[%" PRIu8 "]", node->key, node->balance); |
if (node->lft != NULL || node->rgt != NULL) { |
printf("("); |
|
191,7 → 191,7 |
avltree_create(tree); |
|
if (!quiet) |
printf("Inserting %d nodes...", node_count); |
printf("Inserting %" PRIc " nodes...", node_count); |
|
for (i = 0; i < node_count; i++) { |
newnode = alloc_avltree_node(); |