summaryrefslogtreecommitdiffstats
path: root/node.h
blob: 94ef4e058f57b4c95a2b42d331e9c8f0455d211e (plain)
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
/* definitions are residing in this header since that's how templates get
 * expanded, we could have a separate node.cpp is compiler supports export keyword,
 * instantiations of code are compiled along with the translation units that spawn them
 */

#ifndef _MYNODE_H_
#define _MYNODE_H_

#include <cstdio>

template <class T>
class Node
{
    public:
        Node();
        Node(const Node &);
        Node& operator=(const Node &);
        Node(T);
        Node(T &);
        ~Node();

        T getVal(void) const;
        void setVal(T);
        void setLeft(const Node *);
        void setRight(const Node *);
        Node<T>& getLeft(void) const;
        Node<T>& getRight(void) const;

    private:
        T v;
        Node *left;
        Node *right;

    protected:
};

template <class T>
Node<T>::Node() : v(0), left(NULL), right(NULL)
{
}

template <class T>
Node<T>::Node(const Node& n)
{
    this->v = n.v;
    this->left = n.left;
    this->right = n.right;
}

template <class T>
Node<T>& Node<T>::operator=(const Node &rhs)
{
                      /* don't assign same object */
    if (this == &rhs) /* rhs is a rvalue, hence take addr of it */
        return *this;

    this->v = rhs.v;
    /* these also will assign subtrees, use it wisely? */
    this->left = rhs.left;
    this->right = rhs.right;

    return *this;
}

template <class T>
Node<T>::Node(T n) : left(NULL), right(NULL)
{
    this->v = n;
}

template <class T>
Node<T>::Node(T& n) : left(NULL), right(NULL)
{
    this->v = n;
}

template <class T>
Node<T>::~Node()
{
}

template <class T>
T Node<T>::getVal(void) const
{
    return (this->v);
}

template <class T>
void Node<T>::setVal(T v)
{
    this->v = v;
}

template <class T>
void Node<T>::setLeft(const Node *n)
{
    this->left = const_cast<Node<T> *>(n);
}

template <class T>
void Node<T>::setRight(const Node *n)
{
    this->right = const_cast<Node<T> *>(n);
}

template <class T>
Node<T>& Node<T>::getLeft(void) const
{
    return *(this->left);
}

template <class T>
Node<T>& Node<T>::getRight(void) const
{
    return *(this->right);
}

#endif