Algorithms-and-Datastructures/eulerTour.c at master · simonrueba/Algorithms-and-Datastructures · GitHub

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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
#include "BinaryTreeUnsorted.h"
#include <time.h>

struct unsorted_btree
{
	int size;
	int max;
	int min;
	unsorted_btree_node* root;
};

struct unsorted_btree_node
{
	void* value;
	unsorted_btree_node* left;
	unsorted_btree_node* right;
};

unsorted_btree* btree_create()
{
	unsorted_btree* myBtree = (unsorted_btree*)malloc(sizeof(unsorted_btree));
	myBtree->root = NULL;
	myBtree->size = 0;

	return myBtree;
}

int randomInt()
{
	return rand() % 2;
}

unsorted_btree_node* node_create(void* d)
{
	unsorted_btree_node* myNode = (unsorted_btree_node*)malloc(sizeof(unsorted_btree_node));
	myNode->left = NULL;
	myNode->right = NULL;
	myNode->value = d;

	return myNode;
}

bool btree_insertRec(unsorted_btree_node n, void* d)
{
	if (n == NULL)
		return false;

	int r = randomInt();

	if (r)
	{
		if (n->left == NULL)
		{
			n->left = node_create(d);
		}
		else
		{
			btree_insertRec(n->left, d);
		}
	}
	else
	{
		if (n->right == NULL)
		{
			n->right = node_create(d);
		}
		else
		{
			btree_insertRec(n->right, d);
		}
	}
}

bool btree_insert(unsorted_btree t, void* d)
{
	if (t == NULL)
		return false;
	if (d == NULL)
		return false;

	if (t->root == NULL)
	{
		t->root = node_create(d);
	}
	else
	{
		btree_insertRec(t->root, d);
	}
}

int btree_size(unsorted_btree* t)
{
	return t->size;
}

// EULER TRAVERSAL

void pre_visit()
{
	printf("(");
}

void in_visit(unsorted_btree_node* n)
{
	printf("%d", n->value);
}

void post_visit()
{
	printf(")");
}

void eulerTour(unsorted_btree_node n, void(*preVisit)(), void(*inVisit)(unsorted_btree_node n), void(*postVisit)())
{
	preVisit();

	if (n->left != NULL)
		eulerTour(n->left, preVisit, inVisit, postVisit);

	inVisit(n);

	if (n->right != NULL)
		eulerTour(n->right, preVisit, inVisit, postVisit);

	postVisit();
}

int main()
{
	srand(time(0));

	unsorted_btree* myBtree = btree_create();
	btree_insert(myBtree, 5);
	btree_insert(myBtree, 3);
	btree_insert(myBtree, 4);
	btree_insert(myBtree, 2);
	btree_insert(myBtree, 1);
	btree_insert(myBtree, 7);
	btree_insert(myBtree, 6);
	btree_insert(myBtree, 8);
	btree_insert(myBtree, 9);

	eulerTour(myBtree->root, pre_visit, in_visit, post_visit);

	getchar();
}