123
printf("Second experiment binary tree\n");
tree = bstree_create(*keys, 0);
node_bst = NULL;
for (i = 1; i <= n; i++) {
bstree_add(tree, keys[i - 1], i - 1);
if ((i % 10000) == 0) {
w = keys[i - 1];
t_1 = wtime();
node_bst = bstree_lookup(tree, w);
t_2 = wtime();
t = t_2 - t_1;
printf("n = %d; time = %.6lf\n", i, t);
}
}
free(tree);
free(node_bst);