-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlec1_6.cpp
67 lines (59 loc) Β· 1.1 KB
/
lec1_6.cpp
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
// insertion at any particular position
#include<iostream>
using namespace std;
class Node
{
public:
int data;
Node* next;
Node(int value)
{
data = value;
next = NULL;
}
};
Node* CreateLinkedList(int arr[] , int index , int size)
{
if(index == size)
{
return NULL;
}
Node *temp;
temp = new Node(arr[index]);
temp->next = CreateLinkedList(arr , index+1 , size);
return temp;
}
int main()
{
Node *Head;
Head = NULL;
int arr[] = { 2 , 4, 6, 8};
// 5 values already inserted at end
Head = CreateLinkedList(arr , 0 , 5);
Node *temp;
temp = Head;
while(temp)
{
cout<<temp->data<<" ";
temp = temp->next;
}
cout<<"\nAfter insertion\n";
int x = 3 ; // insertion at 3rd position
int value = 30 ;
temp = Head;
x--;
while(x--)
{
temp = temp->next;
}
Node *temp2 = new Node(value);
temp2->next = temp->next;
temp->next = temp2;
temp = Head;
while(temp)
{
cout<<temp->data<<" ";
temp = temp->next;
}
return 0 ;
}