binary-tree/main.cpp at master · 0xKolten/binary-tree · 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
#include "bst.h"
#include <iostream>
#include <string>
#include <vector>
#include <fstream>
using namespace std;

vector<int> readFile(string filename);

int main() {

    string filename;
    cout << "Enter file name: " << endl;
    cin >> filename;
    cout << endl;

    vector<int> input = readFile(filename);

    cout << endl;
    cout << "Creating tree... " << endl;

    BinarySearchTree tree;
    for (int i = 0; i < input.size(); ++i) {
        tree.insert(input[i]);
    }

    int numNodes = tree.get_numNodes();
    cout << endl;
    cout << "Total nodes: " << numNodes << endl;

    if (numNodes < 17) {
        cout << "Pre Order traversal: " << endl;
        tree.PreOrderTraversal(tree.get_root());

        cout << endl;

        cout << "In Order traversal: " << endl;
        tree.InOrderTraversal(tree.get_root());

        cout << endl;

        cout << "Post Order traversal: " << endl;
        tree.PostOrderTraversal(tree.get_root());

        cout << endl;
    }
    else
        cout << "Not printing: Total nodes larger than 16" << endl;

    cout << endl;
    cout << "Average search cost: " << endl;
    double avg = tree.avg_cost(tree);
    cout << avg << endl;


    if (numNodes < 17) {
        cout << endl;
        cout << "Outputting tree to file..." << endl;
        tree.OutputTree(filename + "_output.txt");
    }

    cout << endl;
    int remove;
    cout << "Enter key to remove: ";
    cin >> remove;
    tree.remove(remove);
    numNodes = tree.get_numNodes();

    cout << endl;
    cout << "Total nodes: " << numNodes << endl;

    if (numNodes < 17) {
        cout << "Pre Order traversal: " << endl;
        tree.PreOrderTraversal(tree.get_root());

        cout << endl;

        cout << "In Order traversal: " << endl;
        tree.InOrderTraversal(tree.get_root());

        cout << endl;

        cout << "Post Order traversal: " << endl;
        tree.PostOrderTraversal(tree.get_root());

        cout << endl;
    }
    else
        cout << "Not printing: Total nodes larger than 16" << endl;

    cout << endl;
    double newAvg = tree.avg_cost(tree);
    cout << "Average search cost: " << endl;
    cout << newAvg << endl;
    cout << endl;


}

vector<int> readFile(string filename) {
    ifstream read;
    read.open(filename);
    int data;
    vector<int> input;
    if (read.is_open()) {
        cout << "Input data: " << endl;
        while (read >> data) {
            input.push_back(data);
            cout << data << endl;
        }
        read.close();
    }
    else
        cout << "File not opened" << endl;
    return input;
}