tree-visualization/main.cpp at main · aoum-m/tree-visualization · 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
//#include "library.h"
//#include <iostream>
//#include <graphics.h>
//
//using namespace std;
//
//int main() {
//    // Initialize graphics
//    initializeGraphics();
//
//    // Initialize the structures
//    BSTNode* bstRoot = nullptr;
//    AVLNode* avlRoot = nullptr;
//    int heap[100];
//    int heapSize = 0;
//
//    int choice;
//    do {
//        cout << "\nSelect the data structure to insert into:\n";
//        cout << "1. Binary Search Tree (BST)\n";
//        cout << "2. AVL Tree\n";
//        cout << "3. Heap\n";
//        cout << "4. Exit\n";
//        cout << "Enter your choice: ";
//        cin >> choice;
//
//        switch (choice) {
//            case 1: { // Insert into BST
//                int data;
//                cout << "Enter value to insert into BST: ";
//                cin >> data;
//                bstRoot = insertBSTNode(bstRoot, data);
//                break;
//            }
//            case 2: { // Insert into AVL Tree
//                int data;
//                cout << "Enter value to insert into AVL Tree: ";
//                cin >> data;
//                avlRoot = insertAVLNode(avlRoot, data);
//                break;
//            }
//            case 3: { // Insert into Heap
//                if (heapSize >= 100) {
//                    cout << "Heap is full. Cannot insert more elements.\n";
//                } else {
//                    int data;
//                    cout << "Enter value to insert into Heap: ";
//                    cin >> data;
//                    heap[heapSize++] = data;
//                    // Ensure the heap property is maintained
//                    heapSort(heap, heapSize);
//                }
//                break;
//            }
//            case 4:
//                cout << "Exiting program. Goodbye!\n";
//                break;
//            default:
//                cout << "Invalid choice. Please try again.\n";
//        }
//
//        // Auto-display after every operation
//        if (choice >= 1 && choice <= 3) {
//            clearScreen();
//            autoDisplay(bstRoot, avlRoot, heap, heapSize);
//        }
//    } while (choice != 4);
//
//    // Close the graphics window
//    closegraph();
//    return 0;
//}
#include "library.h"
#include <iostream>
#include <graphics.h>

using namespace std;

int main() {

    initializeGraphics();

    BSTNode* bstRoot = nullptr;
    AVLNode* avlRoot = nullptr;
    int heap[100];
    int heapSize = 0;

    int choice;
    do {
        cout << "\nSelect the data structure to insert into:\n";
        cout << "1. Binary Search Tree (BST)\n";
        cout << "2. AVL Tree\n";
        cout << "3. Heap\n";
        cout << "4. Exit\n";
        cout << "Enter your choice: ";
        cin >> choice;

        switch (choice) {
            case 1: {
                int data;
                cout << "Enter value to insert into BST: ";
                cin >> data;
                bstRoot = insertBSTNode(bstRoot, data);
                break;
            }
            case 2: {
                int data;
                cout << "Enter value to insert into AVL Tree: ";
                cin >> data;
                avlRoot = insertAVLNode(avlRoot, data);
                break;
            }
            case 3: {
                if (heapSize >= 100) {
                    cout << "Heap is full. Cannot insert more elements.\n";
                } else {
                    int data;
                    cout << "Enter value to insert into Heap: ";
                    cin >> data;
                    heap[heapSize++] = data;

                    heapSort(heap, heapSize);
                }
                break;
            }
            case 4:
                cout << "Exiting program. Goodbye!\n";
                break;
            default:
                cout << "Invalid choice. Please try again.\n";
        }


        if (choice >= 1 && choice <= 3) {
            clearScreen();

            autoDisplay(bstRoot, avlRoot, heap, heapSize);
        }
    } while (choice != 4);


    closegraph();
    return 0;
}