realalg/bst_class.cpp at master · jeyong/realalg · 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
//
//  main.cpp
//  cppstl
//
//  Created by jeyong on 27/07/2018.
//  Copyright © 2018 jeyong. All rights reserved.
//

#include <iostream>
#include <queue>

using namespace std;

template<typename T>
class Node {
public:
    Node() { }
    Node(T v){val = v;}

    T val;

    bool operator== (const Node& obj) const
    {
        if (obj.val == this->val)
        {
            return true;
        }
        return false;
    }
    bool operator> (const Node& obj) const
    {
        if(obj.val < this->val)
        {
            return true;
        }
        return false;
    }

    bool operator< (const Node& obj) const
    {
        if(obj.val > this->val)
        {
            return true;
        }
        return false;
    }

    shared_ptr<Node<int>> left, right = nullptr;
};

template<typename T>
class BSTree {
private:
    size_t  size = 0;
public:
    BSTree() { size = 0;}

    shared_ptr<Node<T>> root;
    void add(shared_ptr<Node<T>> n)
    {
        if (n == nullptr)
        {
            return ;
        }

        auto cur = root;
        if (root == nullptr)
        {
            root = n;
            size++;
            return;
        }

        while(cur != nullptr)
        {
            if (*cur < *n)
            {
               if(cur->right == nullptr)
               {
                   cur->right = n;
                   size++;
                   return;
               }
                cur = cur->right;
            }
            else
            {
                if(cur->left == nullptr)
                {
                    cur->left = n;
                    size++;
                    return;
                }
                cur = cur->left;
            }
        }
    }

    size_t GetSize()
    {
        return size;
    }

    void BFTraversal()
    {
        queue<Node<T>> q;
        if (root == nullptr)
            return;
        q.push(*root);

        while(!q.empty())
        {
            auto n = q.front();
            q.pop();
            cout<<n.val<<endl;
            if (n.left != nullptr) { q.push(*n.left); }
            if (n.right != nullptr) { q.push(*n.right); }
        }
    }
};


int main()
{
    auto t = make_shared<BSTree<int>>();
    for (auto i=0; i<10; i++ )
    {
        t->add(make_shared<Node<int>>(10+i));
    }

    t->BFTraversal();
    return 0;
}