dsa/data_structures/binary_tree/binary_tree.c at master · 1kjnv/dsa · 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
#include <stdio.h>
#include <stdlib.h>

struct node
{
	int data;
	struct node *left, *right;
};

struct node* new(int val);
void preorder(struct node *root);
void inorder(struct node *root);
void postorder(struct node *root);

int main()
{
	struct node *root = new(1);
	root->left = new(2);
	root->right = new(54);

	printf("Preorder: ");
	preorder(root);
	printf("\n");

	printf("Inorder: ");
	inorder(root);
	printf("\n");

	printf("Postorder: ");
	postorder(root);
	printf("\n");

	return 0;
}

struct node* new(int val)
{
	struct node *newNode = (struct node*)malloc(sizeof(struct node));
	newNode->data = val;
	newNode->left = NULL;
	newNode->right = NULL;
	return newNode;
}

// preorder traversal
void preorder(struct node *root)
{
	if(root == NULL)
	{
		return;
	}
	printf("%d ", root->data);
	preorder(root->left);
	preorder(root->right);
}

// inorder traversal
void inorder(struct node *root)
{
	if(root == NULL)
	{
		return;
	}
	inorder(root->left);
	printf("%d ", root->data);
	inorder(root->right);
}

// postorder traversal
void postorder(struct node *root)
{
	if(root == NULL)
	{
		return;
	}
	postorder(root->left);
	postorder(root->right);
	printf("%d ", root->data);
}