_BST/task.cpp at master · Prodigysy/_BST · 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
145
146
#include "BinarySearchTree.h"
#include <vector>
#include <iostream>


BinarySearchTree::Iterator::Iterator(Node* root) {
    pushLeft(root);
}

void BinarySearchTree::Iterator::pushLeft(Node* node) {
    while (node != nullptr) {
        stack.push(node);
        node = node->left;
    }
}

int BinarySearchTree::Iterator::operator*() {
    return stack.top()->key;
}

BinarySearchTree::Iterator& BinarySearchTree::Iterator::operator++() {
    Node* node = stack.top()->right;
    stack.pop();
    pushLeft(node);
    return *this;
}

bool BinarySearchTree::Iterator::operator!=(const Iterator& other) {
    return !stack.empty() || !other.stack.empty();
}

BinarySearchTree::Iterator BinarySearchTree::begin() {
    return Iterator(root);
}

BinarySearchTree::Iterator BinarySearchTree::end() {
    return Iterator(nullptr);
}


std::vector<int> unionBST(BinarySearchTree& tree1, BinarySearchTree& tree2) {
    std::vector<int> result;
    BinarySearchTree::Iterator iter1 = tree1.begin();
    BinarySearchTree::Iterator iter2 = tree2.begin();

    while (iter1 != tree1.end() && iter2 != tree2.end()) {
        if (*iter1 < *iter2) {
            result.push_back(*iter1);
            ++iter1;
        }
        else if (*iter2 < *iter1) {
            result.push_back(*iter2);
            ++iter2;
        }
        else {
            result.push_back(*iter1);
            ++iter1;
            ++iter2;
        }
    }

    while (iter1 != tree1.end()) {
        result.push_back(*iter1);
        ++iter1;
    }

    while (iter2 != tree2.end()) {
        result.push_back(*iter2);
        ++iter2;
    }

    return result;
}

std::vector<int> symmetricDifferenceBST(BinarySearchTree& tree1, BinarySearchTree& tree2) {
    std::vector<int> result;
    BinarySearchTree::Iterator iter1 = tree1.begin();
    BinarySearchTree::Iterator iter2 = tree2.begin();

    while (iter1 != tree1.end() && iter2 != tree2.end()) {
        if (*iter1 < *iter2) {
            result.push_back(*iter1);
            ++iter1;
        }
        else if (*iter2 < *iter1) {
            result.push_back(*iter2);
            ++iter2;
        }
        else {
            ++iter1;
            ++iter2;
        }
    }

    while (iter1 != tree1.end()) {
        result.push_back(*iter1);
        ++iter1;
    }

    while (iter2 != tree2.end()) {
        result.push_back(*iter2);
        ++iter2;
    }

    return result;
}

int main() {
    BinarySearchTree tree1;
    tree1.insert(5);
    tree1.insert(3);
    tree1.insert(7);
    tree1.insert(2);
    tree1.insert(4);

    BinarySearchTree tree2;
    tree2.insert(5);
    tree2.insert(6);
    tree2.insert(7);
    tree2.insert(8);
    tree2.insert(9);

    std::cout << "Tree 1 elements: ";
    tree1.print();
    std::cout << std::endl;

    std::cout << "Tree 2 elements: ";
    tree2.print();
    std::cout << std::endl;

    std::vector<int> unionResult = unionBST(tree1, tree2);
    std::cout << "Union of tree1 and tree2: ";
    for (int key : unionResult) {
        std::cout << key << " ";
    }
    std::cout << std::endl;

    std::vector<int> diffResult = symmetricDifferenceBST(tree1, tree2);
    std::cout << "Symmetric difference of tree1 and tree2: ";
    for (int key : diffResult) {
        std::cout << key << " ";
    }
    std::cout << std::endl;

    return 0;
}