DataStructuresInC-/BST.cpp at master · VarunManchanda/DataStructuresInC- · 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
#include <iostream>
using namespace std;

class Node
{
	public:
	int data;
	Node *left;
	Node *right;
};

Node *root = NULL;
Node *insert(Node *, int);
Node * insertNode(Node *root, int data)
{
	return insert(root,data);
}

Node * insert(Node *root, int data)
{
	if(root==NULL)
	{
		Node *n = new Node();
		n->data = data;
		n->left = n->right = NULL;
		root = n;
	}
	else if(data < root->data)
	{
		root->left = insert(root->left, data);
	}
	else if(data > root->data)
	{
		root->right = insert(root->right, data);
	}
	return root;
}

Node * findMin(Node *root)
{
	if(root==NULL)
	{
		return root;
	}
	else if(root->left!=NULL)
	{
		return findMin(root->left);
	}
	return root;
}

Node * deleteNode(Node *root, int data)
{
	if(root==NULL)
	{
		return root;
	}
	else if(data < root->data)
	{
		root->left = deleteNode(root->left, data);
	}
	else if(data > root->data)
	{
		root->right = deleteNode(root->right, data);
	}
	else
	{
		if(root->left==NULL && root->right==NULL)
		{
			Node *temp = root;
			root = NULL;
			free(temp);
		}

		else if(root->left==NULL)
		{
			Node *temp = root;
			root = root->right;
			free(temp);
		}
		else if(root->right==NULL)
		{
			Node *temp = root;
			root = root->left;
			free(temp);
		}
		else{
			Node *temp = findMin(root->right);
			root->data = temp->data;
			root->right = deleteNode(root->right, temp->data);
		}
	}
	return root;
}

void inOrder(Node *root)
{
	if(root)
	{
		inOrder(root->left);
		cout<<root->data<<" ";
		inOrder(root->right);
	}
}

void preOrder(Node *root)
{
	if(root)
	{
		cout<<root->data<<" ";
		preOrder(root->left);
		preOrder(root->right);
	}
}

void postOrder(Node *root)
{
	if(root)
	{
		postOrder(root->left);
		postOrder(root->right);
		cout<<root->data<<" ";
	}
}


int main() {
	root = insertNode(root,3);
	root = insertNode(root,2);
	root = insertNode(root,5);
	root = insertNode(root,4);
	root = insertNode(root,6);
	inOrder(root);
	cout<<endl;
	root = deleteNode(root, 5);
	preOrder(root);
	cout<<endl;
	postOrder(root);
	return 0;
}