algorithmic-complexity-comparison/c++BinaryTreeNode.h at main · ethan-mcmanus-dev/algorithmic-complexity-comparison · 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
#ifndef BINARYTREENODE_H
#define BINARYTREENODE_H

class BinaryTreeNode {
public:
    int data;
    BinaryTreeNode* left;
    BinaryTreeNode* right;

    // init node
    BinaryTreeNode(int value) : data(value), left(nullptr), right(nullptr) {}

    // free memory
    ~BinaryTreeNode() {
        delete left;
        delete right;
    }

    // add left node
    void insertLeft(int value) {
        if (!left) {
            left = new BinaryTreeNode(value);
        } else {
            BinaryTreeNode* newNode = new BinaryTreeNode(value);
            newNode->left = left;
            left = newNode;
        }
    }

    // add right node
    void insertRight(int value) {
        if (!right) {
            right = new BinaryTreeNode(value);
        } else {
            BinaryTreeNode* newNode = new BinaryTreeNode(value);
            newNode->right = right;
            right = newNode;
        }
    }
};

#endif