binary_search_tool/full_bisect_test/inorder.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

#include <stdio.h>
#include <stdlib.h>
#include "bin-trees.h"

static void
real_inorder (tree_ptr root)
{
  if (root == NULL)
    return;

  real_inorder (root->left);
  printf ("%d ", root->data);
  real_inorder (root->right);
}

void
in_order_traverse (tree_ptr root)
{
  printf ("in-order traversal, with recursion: \n");
  real_inorder (root);
  printf ("\n");
}