Algorithms/AVLMain.cpp at main · right9alt/Algorithms · 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
#include "AVLtree.h"

#include "iostream"
using namespace std;

//25 50 75 60 68 10 18 15 6 3 7
//óäàëèòü 50
int main()
{
	node* root = nullptr;

	cout << "Skolko elementov dobavit?";
	int x; cin >> x; int tmp;
	for (int i = 0; i < x; i++)
	{
		cout << "Current Element: ";
		cin >> tmp;
		root = insert(root, tmp);
	}
	cout << "\nPostorder\n";
	postorder(root);
	cout << "\nInorder\n";
	inorder(root);
	cout << "\nPreorder\n";
	preorder(root);
	cout << "Skolko elementov udalit?";
	cin >> x;
	for (int i = 0; i < x; i++)
	{
		cout << "Current Element: ";
		cin >> tmp;
		root = delete_node(root, tmp);
		cout << "\nPreorder\n";
		preorder(root);
		cout << "\nPostorder\n";
		postorder(root);
		cout << "\nInorder\n";
		inorder(root);
	}
	cout << "\nPreorder\n";
	preorder(root);
	cout << "\nPostorder\n";
	postorder(root);
	cout << "\nInorder\n";
	inorder(root);

}