#include <iostream>

using namespace std;

struct node {
int x;
node* next;
};

int main()
{
node* L; //mozhe node*L=NULL;
L = NULL;
node* temp1 = new node;
temp1->x = 1;
temp1->next = NULL;
L = temp1;
node* temp2 = new node;
temp2->x = 2;
temp2->next = NULL;
temp1->next = temp2;
node* temp3 = new node;
temp3->x = 3;
temp3->next = NULL;
temp2->next = temp3;

cout << "Linked list: ";

while (L != NULL)
{
cout << L->x << "\t";
L = L->next;
}
//DODADI 2 NOVI JAZLI

node* temp4 = new node;

temp4->x = 4;
temp4->next = NULL;
temp3->next = temp4;
node* temp5 = new node;
temp5->x = 5;
temp5->next = NULL;
temp4->next = temp5;

//za da gi ispecati samo novite vrednosti

L = temp4;
cout << "Linked list: ";
while (L != NULL)
{
cout << L->x << "\t";
L = L->next;
}
//da se izbrishat prvite 2 jazli
//L da pokazue na temp2, temp1 delete, pa L da pkazue na temp 3, delete temp2

L = temp2;
delete temp1;
L = temp3;
delete temp2;

cout << "Linked list: ";

while (L != NULL)
{
cout << L->x << "\t";
L = L->next;
}

//da se napishe kod koj kje broe kolku jazli ima u listata
L = temp3;
int br = 0;
while (L != NULL)
{
br++;
L = L->next;
cout << "Total number of elements is: " << br;

//da se presmeta suma 3+4+5

L = temp3;
int sum = 0;
while (L != NULL)
{
sum = sum + L->x;
L = L->next;
}
cout << "The sum is: " << sum << endl;

//da napisheme kod korisnikot da vnese nekoja vrednost, da se proveri dali taja
vrednost ja ima vo
//listata ako ja ima da ispecati deka ja ima, ako ja nema da ispecati deka taa
vrednost ja nema vo listata

L = temp3;
int n, brojac=0;
cout << "Vnesi vrednost";
cin >> n;
while (L != NULL)
{
if (L->x == n)
{
cout << "Vrednosta n se pojavuva vo listata";
brojac++;
}
L = L->next;
}
if (brojac == 0)
cout << "Vrednosta n ne se pojavuva vo listata" << endl;
NOVA ZADACA
#include <iostream>
using namespace std;
struct node {
int x;
node* next;
};

int main()
{
node* temp, * startN = NULL, * endN = NULL;
temp = new node;
temp->x = 34;
temp->next = NULL;
startN = temp;
endN = temp;
temp = new node;
endN->next = temp;
temp->x = 13;
temp->next = NULL;
endN = temp;
while (startN != NULL)
{
cout << startN->x << "\t"; startN = startN->next;
}
}

//kreiranje na nov jazol

temp = new node;
endN->next = temp;
temp->x = 25;
temp->next = NULL;
endN = temp;

while (startN != NULL)

{
cout << startN->x << "\t"; startN = startN->next;
}
//while se prefrlja posleden da bide za da gi procita svite
Novaaaaaaaaaaaa zadacaaaaaaaaa

#include <iostream>
using namespace std;
struct node {
int x;
node* next;
};

int main(){
//da se prasha korisnikot kolku jazli sakame da vneseme vo lista
node* temp, * startN = NULL, * endN = NULL;
int n;
cout << "Kolku jazli kje vnesete" << endl;
cin >> n;
for (int i = 1; i <= n; i++)
{
temp = new node;
int x;
cout << "Vnesi vrednost za jazolot" << i << endl;;
cin >> x; //primer 5
temp->next = NULL;
if (startN == NULL)
startN = temp;
else
endN->next = temp;

endN = temp;
}
cout << "Linked list: ";
while (startN != NULL)
{
cout << startN->x << endl;
startN = startN->next;
}
}
Novaaa zadaca

#include <iostream>
using namespace std;
struct node {
int x;
node* next;
};

int main(){
//da se prasha korisnikot kolku jazli sakame da vneseme vo lista no na pocetok
node* temp, * startN = NULL, * endN = NULL;
int n;
cout << "Kolku jazli kje vnesete" << endl;
cin >> n;
for (int i = 1; i <= n; i++)
{
temp = new node;

cout << "Vnesi vrednost za jazolot" << i << endl;;

cin >> temp->x; //primer 5
temp->next = NULL;
//ako e vnesen jazol, if kje go preskoci kje go izvrshi else
if (startN == NULL)
{
startN = temp;
endN = temp;
}
else
temp->next = startN;
startN = temp;
}
cout << "Linked list: ";
while (startN != NULL)
{
cout << startN->x << endl;
startN = startN->next;
}
}