-
Notifications
You must be signed in to change notification settings - Fork 34
/
InsertLL(Rec)
63 lines (59 loc) · 1.19 KB
/
InsertLL(Rec)
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
#include <iostream>
class Node{
public:
int data;
Node *next;
Node(int data){
this -> data = data;
this -> next = NULL;
}
};
using namespace std;
Node* takeinput() {
int data;
cin >> data;
Node* head = NULL, *tail = NULL;
while(data != -1){
Node *newNode = new Node(data);
if(head == NULL) {
head = newNode;
tail = newNode;
}
else{
tail -> next = newNode;
tail = newNode;
}
cin >> data;
}
return head;
}
void print(Node *head) {
Node *temp = head;
while(temp != NULL) {
cout << temp -> data << " ";
temp = temp -> next;
}
cout<<endl;
}
Node* insertNodeRec(Node *head, int i, int data) {
if(head==NULL){
return head;
}
if(i==0){
Node* newNode = new Node(data);
newNode->next=head;
head=newNode;
return head;
}
Node* x = insertNodeRec(head->next, i-1, data);
head->next = x;
return head;
}
int main() {
Node *head = takeinput();
int pos, data;
cin >> pos >> data;
head = insertNodeRec(head, pos, data);
print(head);
return 0;
}