CS-202/InsertandDelete.cpp at main · asv018/CS-202 · 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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
#include <iostream>

using namespace std;

struct Node
{
  int data;
  Node *next;
};

Node *head = NULL;

void insertAtHead(int data)
{
  Node *newNode = new Node();
  newNode->data = data;
  newNode->next = head;
  head = newNode;
}

void insertAtTail(int data)
{
  Node *newNode = new Node();
  newNode->data = data;
  newNode->next = NULL;

  if (head == NULL)
  {
    head = newNode;
    return;
  }

  Node *temp = head;
  while (temp->next != NULL)
  {
    temp = temp->next;
  }
  temp->next = newNode;
}

void insertAtPosition(int data, int position)
{
  if (position == 1)
  {
    insertAtHead(data);
    return;
  }

  Node *newNode = new Node();
  newNode->data = data;

  Node *temp = head;
  for (int i = 0; i < position - 2; i++)
  {
    temp = temp->next;
  }
  newNode->next = temp->next;
  temp->next = newNode;
}

void deleteAtHead()
{
  if (head == NULL)
  {
    return;
  }

  Node *temp = head;
  head = head->next;
  delete temp;
}

void deleteAtTail()
{
  if (head == NULL)
  {
    return;
  }

  if (head->next == NULL)
  {
    delete head;
    head = NULL;
    return;
  }

  Node *temp = head;
  while (temp->next->next != NULL)
  {
    temp = temp->next;
  }
  delete temp->next;
  temp->next = NULL;
}

void deleteAtPosition(int position)
{
  if (head == NULL)
  {
    return;
  }

  if (position == 1)
  {
    deleteAtHead();
    return;
  }

  Node *temp = head;
  for (int i = 0; i < position - 2; i++)
  {
    temp = temp->next;
  }
  Node *nodeToDelete = temp->next;
  temp->next = nodeToDelete->next;
  delete nodeToDelete;
}

void printList()
{
  Node *temp = head;
  while (temp != NULL)
  {
    cout << temp->data << " ";
    temp = temp->next;
  }
  cout << endl;
}

int main()
{
  insertAtHead(5);
  insertAtHead(10);
  insertAtHead(15);
  cout << "List after inserting at head: ";
  printList();

  insertAtTail(20);
  insertAtTail(25);
  cout << "List after inserting at tail: ";
  printList();

  insertAtPosition(30, 3);
  cout << "List after inserting at position 3: ";
  printList();

  deleteAtHead();
  cout << "List after deleting at head: ";
  printList();

  deleteAtTail();
  cout << "List after deleting at tail: ";
  printList();

  deleteAtPosition(2);
  cout << "List after deleting at position 2: ";
  printList();

  return 0;
}