cp-stuff/linked_list.cpp at master · zunaid13/cp-stuff · 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
147
148
149
150
151
152
153
#include <iostream>
#include <stack>

using namespace std;

class single_linked
{
private:
    int size;
    struct _node
    {
        int val;
        _node *next;
    };
    _node* head;

public:
    single_linked()
    {
        size = 0;
        head = NULL;
    }
    _node* create_node(int val)
    {
        _node* new_node = new _node();
        new_node->val = val;
        return new_node;
    }
    void push_back(int val)
    {
        _node* temp = head, *new_node = create_node(val);
        size++;
        new_node->next = NULL;
        if(size == 1)
        {
            head = new_node;
            return;
        }
        while(temp->next != NULL)
            temp = temp->next;
        temp->next = new_node;
    }
    void pop_back()
    {
        _node* temp = head;
        size--;
        if(size == 0)
        {
            delete head;
            head = NULL;
            return;
        }
        while(temp->next->next != NULL)
            temp = temp->next;
        delete temp->next;
        temp->next = NULL;
    }
    void print()
    {
        _node* temp = head;
        while(temp != NULL)
        {
            cout << temp->val << " ";
            temp = temp->next;
        }
        cout << endl;
    }
    void push_front(int val)
    {
        _node* temp = head, *new_node = create_node(val);
        size++;
        new_node->next = head;
        head = new_node;
    }
    void pop_front()
    {
        _node* temp = head;
        size--;
        head = head->next;
        delete temp;
    }
    bool find_val(int val)
    {
        _node* temp = head;
        while(temp != NULL)
        {
            if(temp->val == val)
                return true;
            temp = temp->next;
        }
        return false;
    }
    void insert_after(int val, int targ)
    {
        if(!find_val(targ)) return;
        size++;
        _node* new_node = create_node(val);
        _node* temp = head;
        while(temp-> val != targ)
            temp = temp->next;
        new_node->next = temp->next;
        temp->next = new_node;
    }
    void remove_val(int val)
    {
        if(!find_val(val)) return;
        _node* temp = head;
        size--;
        if(head->val == val)
        {
            head = head->next;
            delete temp;
            return;
        }
        while(temp->next->val != val)
            temp = temp->next;
        _node* del = temp->next;
        temp->next = temp->next->next;
        delete del;
    }
    void reverse()
    {
        stack <int> stk;
        while(size != 0)
        {
            stk.push(head->val);
            pop_front();
        }
        while(!stk.empty())
        {
            push_back(stk.top());
            stk.pop();
        }
    }
};

int main()
{
    single_linked A;
    A.push_back(1);
    A.push_back(2);
    A.push_back(3);
    A.push_back(4);
    A.push_front(5);
    A.push_front(6);
    A.insert_after(99, 5);
    // A.remove_val(5);

    A.print();
    A.reverse();
    A.print();
    return 0;
}