00:10:00
TD-03700252 a suspension is a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension in a suspension c
#include <iostream>
using namespace std;
class Node
{
public:
int data;
Node *next;
};
class LinkedList
{
public:
Node *head;
LinkedList()
{
head = NULL;
}
void insertTail(int value)
{
Node *temp = new Node();
temp->data = value;
if(head == NULL)
{
head = temp;
return;
}
Node *cur = head;
while(cur != NULL)
{
cur = cur->next;
}
cur = temp;
}
void print()
{
Node *cur = head;
while(cur != NULL)
{
cout << cur->data << " ";
cur = cur->next;
}
cout << endl;
}
void insertHead(int value)
{
Node *temp = new Node();
temp->data = value;
temp->next = head;
head = temp;
}
void insertAfter(int value, int position)
{
Node *temp = new Node();
temp->data = value;
Node *cur = head;
while(cur != NULL)
{
if(cur->data == position)
{
temp->next = cur->next;
cur->next = temp;
return;
}
cur = cur->next;
}
}
void deleteHead()
{
Node *temp = head;
head = head->next;
delete temp;
}
void deleteTail()
{
Node *cur = head;
while(cur->next->next != NULL)
{
cur = cur->next;
}
Node *temp = cur->next;
cur->next = NULL;
delete temp;
}
void deleteatPosition(int value)
{
Node *cur = head;
while(cur->next->data != value)
{
cur = cur->next;
}
Node *temp = cur->next;
cur->next = cur->next->next;
delete temp;
}
void deleteatPosition(int value)
{
Node *cur = head;
while(cur->next->data != value)
{
cur = cur->next;
}
Node *temp = cur->next;
cur->next = cur->next->next;
delete temp;
}
};
int main()
{
LinkedList l;
l.insertHead(1);
l.insertHead(2);
l.insertHead(3);
l.insertHead(4);
l.insertHead(5);
l.insertHead(6);
l.insertHead(7);
l.insertHead(8);
l.insertHead(9);
l.insertHead(10);
l.insertHead(11);
l.insertHead(12);
l.insertHead(13);
l.insertHead(14);
l.insertHead(15);
l.insertHead(16);
l.insertHead(17);
l.insertHead(18)
l.insertHead(19);
l.insertHead(20);
l.insertHead(21);
l.insertHead(22);
l.insertHead(23);
l.insertHead(24);
l.insertHead(25);
l.insertHead(26);
l.insertHead(27);
l.insertHead(28);
l.insertHead(29);
l.insertHead(30);
l.insertHead(31);
l.insertHead(32);
l.insertHead(34);
l.insertHead(35);
l.insertHead(36);
l.insertHead(37);
l.insertHead(37);
l.insertHead(38);
l.insertHead(39);
l.insertHead(40);
l.insertHead(41);
l.insertHead(42);
l.insertHead(43);
l.insertHead(44);
l.insertHead(45);
l.insertHead(46);
l.insertHead(47);
l.insertHead(48);
l insertHead(49);
l insertHead(50);
l insertHead(51);
l insertHead(52);
l insertHead(53);
l insertHead(54);
l insertHead(55);
l insertHead(56);
l insertHead(57);
l insertHead(58);
l insertHead(59);
l insertHead(60);
l insertHead(61);
l insertHead(62);
l insertHead(53);
l insertHead(54);
l insertHead(55);
l insertHead(56);
l insertHead(61);
l insertHead(63);
l insertHead(64);
l insertHead(65);
l insertHead(66);
l insertHead(67);
l insertHead(68);
l insertHead(69);
l insertHead(71);
l insertHead(72);
l insertHead(76);
l insertHead(77);
l insertHead(79);
l insertHead(81);
l insertHead(83);
l insertHead(84);
l insertHead(86);
l insertHead(87);
l insertHead(88);
l insertHead(89);
l insertHead(92);
l insertHead(93);
l insertHead(92);
l insertHead(94);
l insertHead(98);
l insertHead(100);
l insertHead(104);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99)
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99);
l insertHead(99)
<iostream>
using namespace std;
class Node
public:
int value;
Node *next;
void insertHead(int value){
Node *temp = new Node();
temp->data = value;
temp->next = head;
head = temp;
}
void insertHead(int value)
{
Node *temp = new Node();
temp->data = value;
temp->next = head;
head = temp;
}
void deleteHead()
{
Node *temp = head;
head = head->next;
delete temp;
}
void deleteTail()
{
Node *cur = head;
while(cur->next->next != NULL)
{
cur = cur->next;
}
Node *temp = cur->next;
cur->next = NULL;
delete temp;
}
void deleteatPosition(int value)
{
Node *cur = head;
while(cur->next->data != value)
{
cur = cur->next;
}
Node *temp = cur->next;
cur->next = cur->next->next;
delete temp;
}
};
int main()
{
Node *head = new Node();
head->data = 1;
head->next = NULL;
Node *cur = head;
while(cur != NULL)
{
printf("%d ", cur->data);
cur = cur->next;
}
printf("
");
return 0;
}
4 Dec 2020
English
中文
日本語
Bahasa Indo
