daily_coding/invert_binary.cpp at main · Basit-Rahim/daily_coding · 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
#include<iostream>
using namespace std;


struct Node {
    int value;
    Node* left;
    Node* right;
    Node(int a) : value(a), left(nullptr), right(nullptr) {}
};

class Tree {
    public:
        Node* root;
        Tree(int a) {
            root = new Node(a);
        }
        void insert(int a){
            Node * curr_node = root;
            while(true){
                if (a>curr_node->value && curr_node->right == nullptr){
                    Node * new_node = new Node(a);
                    curr_node->right = new_node;
                    break;
                }
                if (a<curr_node->value && curr_node->left == nullptr){
                    Node * new_node = new Node(a);
                    curr_node->left = new_node;
                    break;
                }
                if (a == curr_node->value){
                    break;
                }
                if (a<curr_node->value){

                    curr_node = curr_node->left;
                    continue;
                }
                if (a>curr_node->value){
                    curr_node = curr_node->right;
                }

            }
        }

};
void print(Node * curr_node){
    if (curr_node==nullptr){
        return;
    }
    print(curr_node->left);
    cout<<curr_node->value<<" ";
    print(curr_node->right);
}

Node * find_max(Node * node){
    if (node == nullptr)
    return node;
    if (node->right == nullptr){
        return node;
    }
    return find_max(node->right);
}

Node * deleteNode(Node * value, int key){
    if( value == nullptr){
        return value;
    }
    if (value->value < key){
        value->right = deleteNode(value->right,key);
    }
    else if (value->value > key){
        value-> left = deleteNode(value->left,key);
    }
    else{
        if(value->left==nullptr && value ->right == nullptr){
            delete value;
            return nullptr;
        }
        if ( value -> left == nullptr){
            Node * temp = value->right;
            delete value;
            return temp;
        }
        if ( value -> right == nullptr){
            Node * temp = value->left;
            delete value;
            return temp;
        }
        else{
            Node * max = find_max(value->left);
            value->value = max->value;
            value->left = deleteNode(value->left,max->value);
        }
    }
    return value;
}

Node * invert(Node * value){
    if (value == nullptr){
        return value;
    }
    Node * temp = value->left;
    value->left = value->right;
    value->right = temp;
    invert(value->right);
    invert(value->left);
    return value;

}


int main(){
    Tree obj (5);
    obj.insert(6);
    obj.insert(8);
    obj.insert(13);
    obj.insert(3);
    obj.insert(4);
    obj.insert(1);
    obj.insert(2);
    obj.insert(7);
    print(obj.root);
    cout<<endl;
    obj.root = invert(obj.root);
    // obj.root = deleteNode(obj.root,8);
    // obj.root = deleteNode(obj.root,1);
    // obj.root = deleteNode(obj.root,5);
    // obj.root = deleteNode(obj.root,6);
    // obj.root = deleteNode(obj.root,8);
    print(obj.root);
}