cpp/list-operations.cpp at main · kushadige/cpp · 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
#include <iostream>
using std::cout;
class Node {
    int info;
    Node *next = nullptr;
public:
    Node(){
        cout << "node constructor\n";
    }
    ~Node(){
        cout << "node destructor\n";
    }

    friend void insafter(Node *p, int x);
    friend void delafter(Node *p);
    friend void printlist(Node *p);
    friend void reverse(Node *p);
};
void insafter(Node *p, int x){
    Node *newNode = new Node();
    newNode->info = x;
    newNode->next = p->next;
    p->next = newNode;
}
void delafter(Node *p){
    if(p->next==nullptr){
        cout << "void deletion\n";
        return;
    }
    Node *temp;
    temp = p->next;
    p->next = temp->next;
    delete temp;
}
void printlist(Node *p){
    Node *temp = p->next;
    while(temp!=nullptr){
        cout << temp->info << "-";
        temp = temp->next;
    }
    cout << "\n";
}

void reverse(Node *p){
    Node *temp = p->next;

    Node *a=temp,*b=nullptr;
    while(temp!=nullptr){
        a = temp->next;
        temp->next = b;
        b = temp;
        temp = a;
    }

    p->next = b;
}
int main(){
    Node *list = new Node();

    insafter(list,10);
    insafter(list,20);
    insafter(list,30);
    insafter(list,40);
    insafter(list,50);

    printlist(list);

    reverse(list);

    printlist(list);

    delafter(list);
    delafter(list);

    printlist(list);

    delafter(list);
    delafter(list);
    delafter(list);
    delafter(list);
    delafter(list);
    delafter(list);
    delete list;
}