aboutsummaryrefslogtreecommitdiff
path: root/src/binary-search-tree.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/binary-search-tree.c')
-rw-r--r--src/binary-search-tree.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/src/binary-search-tree.c b/src/binary-search-tree.c
index 93690e2..780ba70 100644
--- a/src/binary-search-tree.c
+++ b/src/binary-search-tree.c
@@ -318,7 +318,7 @@ tree_apply_postorder(struct tree_node *tree, void (*visit)(T key, void *cl), voi
318/* --8<-- tree_stack_type */ 318/* --8<-- tree_stack_type */
319struct stack_item { 319struct stack_item {
320 struct stack_item *next; 320 struct stack_item *next;
321 struct tree_node * data; 321 struct tree_node *data;
322}; 322};
323 323
324struct stack { 324struct stack {
@@ -404,7 +404,7 @@ stack_free(struct stack *stack)
404/* --8<-- tree_queue_type */ 404/* --8<-- tree_queue_type */
405struct queue_item { 405struct queue_item {
406 struct queue_item *next; 406 struct queue_item *next;
407 struct tree_node * data; 407 struct tree_node *data;
408}; 408};
409 409
410struct queue { 410struct queue {
@@ -792,7 +792,7 @@ main(void)
792 show_tree(tree, 0, 0); 792 show_tree(tree, 0, 0);
793 793
794 struct tree_iterator it; 794 struct tree_iterator it;
795 struct tree_node * node = tree_preorder_iterator_first(&it, tree); 795 struct tree_node *node = tree_preorder_iterator_first(&it, tree);
796 while ( node ) { 796 while ( node ) {
797 fprintf(stdout, "%d\n", node->key); 797 fprintf(stdout, "%d\n", node->key);
798 798