Home | History | Annotate | Download | only in full_bisect_test 
      1 #include <stdio.h>
      2 #include <stdlib.h>
      3 #include "bin-trees.h"
      4 
      5 static void
      6 real_inorder (tree_ptr root)
      7 {
      8   if (root == NULL)
      9     return;
     10 
     11   real_inorder (root->left);
     12   printf ("%d ", root->data);
     13   real_inorder (root->right);
     14 }
     15 
     16 void
     17 in_order_traverse (tree_ptr root)
     18 {
     19   printf ("in-order traversal, with recursion: \n");
     20   real_inorder (root);
     21   printf ("\n");
     22 }
     23