DataStructure/outputlinkedlist.cpp at main · Deepanshugupta65/DataStructure · 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 <bits/stdc++.h>    // node insert at i th nposurt
using namespace std;

class Node {
    public:
    int data;
    Node* next;
    Node(int data){
        this->data=data;
        next=NULL;
    }
};
Node* takeinput_better(){
    int data;
    cin>>data;
    Node *head = NULL;
    Node *tail = NULL;
    while(data != -1){
        Node *newNode = new Node(data);
        if(head==NULL){
            head = newNode;
            tail = newNode;
        }
        else {

                tail -> next = newNode;
                tail = tail->next;
         }
        cin>>data;
    }
    return head;
}


Node* insertNode(Node *head,int i,int data){
    Node *newNode = new Node(data);
    int count = 0;
    Node *temp=head;

    if(i==0){
       newNode -> next = head;
       head = newNode;
       return head;
    }
    while(temp != NULL && count<i-1){
        temp=temp->next;
        count++;
    }
    if(temp != NULL){
        Node *a = temp->next;
        temp -> next = a;
    }
    return head;
}
void printList(Node* head){

    while (head != NULL){
    cout << head->data<<" ";
    head = head->next;
    }
}

int main() {

    Node *head = takeinput_better();
    printList(head);
    int data,i;
    cin>>i>>data;
    head = insertNode(head,i,data);
    printList(head);
    return 0;
}
*/
// insert at begining node
#include <bits/stdc++.h>
using namespace std;

class Node {
    public:
    int data;
    Node* next;
    Node(int data){
        this->data=data;
        next=NULL;
    }
};
Node* takeinput_better(){
    int data;
    cin>>data;
    Node *head = NULL;
    Node *tail = NULL;
    while(data != -1){
        Node *newNode = new Node(data);
        if(head==NULL){
            head = newNode;
            tail = newNode;
        }
        else {

                tail -> next = newNode;
                tail = tail->next;
         }
        cin>>data;
    }
    return head;
}
Node* insertatbeg(Node *head, int data){

    Node *newNode = new Node(data);
    newNode -> next= head;
    head=newNode;
    return head;
}

void printList(Node* head){

    while (head != NULL){
    cout << head->data<<" ";
    head = head->next;
    }
}

int main() {

    Node *head = takeinput_better();
    printList(head);
    int data;
    cin>>data;
    head = insertatbeg(head,data);
    printList(head);
    return 0;
}