blob: a03f4818b28564dd9eb5967e1c000b9244c499ca (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
|
#include <stdlib.h>
#include <stdio.h>
#include "bin-trees.h"
static void
real_in_order_traverse_no_recurse (tree_ptr root)
{
struct stack_struct *stack = NULL;
tree_ptr current= root;
int going_left = 1; /* boolean variable */
while (current != NULL)
{
while ((current->left != NULL) && going_left)
{
push (&stack, current);
current = current->left;
}
printf ("%d ", current->data);
if (current->right)
{
current = current->right;
going_left = 1;
}
else if (stack != NULL)
{
current = pop(&stack);
going_left = 0;
}
else
current = NULL;
}
}
void
in_order_traverse_no_recurse (tree_ptr root)
{
printf ("in-order traversal, without recursion: \n");
real_in_order_traverse_no_recurse (root);
printf ("\n");
return;
}
|