-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathInserting a node.cpp
77 lines (61 loc) · 1.17 KB
/
Inserting a node.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
68
69
70
71
72
73
74
75
76
77
#include<iostream>
using namespace std;
class Node
{
public:
int data;
Node* next;
};
void first(Node** head_ref,int new_data)
{
Node* new_node=new Node();
new_node->data=new_data;
new_node->next=(*head_ref);
(*head_ref) = new_node;
}
void insertAfter(Node* prev_node,int new_data)
{
if(prev_node==NULL)
{
cout<<"the given previous node cannot be NULL";
return;
}
Node* new_node= new Node();
new_node->data = new_data;
new_node->next=prev_node->next;
prev_node->next = new_node;
}
void append(Node** head_ref, int new_data)
{
Node* new_node= new Node();
Node *last = *head_ref;
new_node->data = new_data;
new_node->next = NULL;
if (*head_ref == NULL)
{
*head_ref = new_node;
return;
}
while (last->next != NULL)
last = last->next;
last->next = new_node;
return;
}
void printList(Node *node)
{
while (node != NULL)
{
cout<<node->data;
node = node->next;
}
}
int main()
{
Node* head = NULL;
append(&head, 6);
first(&head, 7);
first(&head, 1);
append(&head, 4);
insertAfter(head->next, 8);
printList(head);
}