Ma’lumotlar tuzilmasi va algortimlar

“Ma’lumotlar tuzilmasi va algortimlar” fanidan topshiriq bo’yicha hisobot
Topshiriq: 3
Guruh: SWD020-2
Talaba: Atoyev Behruz

1-vazifa. N o’lchamli sonli qiymatdagi to’plam berilgan. Dinamik massiv ko’rinishida stek yaratilsin va to’plam elementlari stekga qo’shilsin. Stek cho’qqisidan 1 ta element olinsin va ekranga chiqarilsin. Stekga yangi 1 ta element qo’shilsin. Stek barcha elementlari ekranga chiqarilsin.
Yechimi:
#include
using namespace std;

class twoStacks {

int* arr;
int size;
int top1, top2;

public:
twoStacks(int n)

{
size = n;
arr = new int[n];
top1 = n / 2 + 1;
top2 = n / 2;
}

void push1(int x)

{


if (top1 > 0) {
top1--;
arr[top1] = x;
}
else {
cout<< "element : " << x << endl;
return;
}
}

void push2(int x)

{

if (top2 < size - 1) {

top2++;
arr[top2] = x;
}
else {
cout<< "element : " << x << endl;
return;
}
}

int pop1()

{
if (top1 <= size / 2) {
int x = arr[top1];
top1++;
return x;
}
else {
cout << "Stack UnderFlow";
exit(1);
}
}

int pop2()

{
if (top2 >= size / 2 + 1) {
int x = arr[top2];
top2--;
return x;
}
else {
cout << "Stack UnderFlow" << endl;
exit(1);
}
}
};

/*test twoStacks class */

int main()
{
twoStacks ts(5);
ts.push1(5);
ts.push2(10);
ts.push2(15);
ts.push1(11);
ts.push2(7);
cout << "Popped element from stack1 "
<< ": " << ts.pop1() << endl;
ts.push2(40);
cout << "Popped element from stack2 "
<< ": " << ts.pop2() << endl;
return 0;
}



2-vazifa. N o’lchamli sonli qiymatdagi to’plam berilgan. Bir bog’lamli ro’yhat ko’rinishida stek yaratilsin va to’plam elementlari stekga qo’shilsin. Stek cho’qqisidan 1 ta element olinsin va ekranga chiqarilsin. Stekga yangi 1 ta element qo’shilsin. Stek barcha elementlari ekranga chiqarilsin.
Yechimi:
#include
using namespace std;

class Node {

public:
int data;
Node* link;

Node(int n)

{
this->data = n;
this->link = NULL;
}
};

class Stack {

Node* top;

public:
Stack() { top = NULL; }

void push(int data)
{

Node* temp = new Node(data);

if (!temp) {
cout << "\nbosh";
exit(1);
}

temp->data = data;

temp->link = top;

top = temp;

}

bool isEmpty()

{

return top == NULL;

}

int peek()

{

if (!isEmpty())

return top->data;
else
exit(1);
}

void pop()

{
Node* temp;

if (top == NULL) {

cout << "\nbosh" << endl;
exit(1);
}
else {

temp = top;

top = top->link;

free(temp);

}
}

void display()

{
Node* temp;

if (top == NULL) {

cout << "\n bosh ";
exit(1);
}
else {
temp = top;
while (temp != NULL) {

cout << temp->data;

temp = temp->link;

if (temp != NULL)
cout << " -> ";
}
}
}
};

int main()

{
// stack yaratish
Stack s;

s.push(11);

s.push(22);
s.push(33);
s.push(44);

s.display();

cout << "\nTop element " << s.peek() << endl;

// stackning top elementlarini ochirish
s.pop();
s.pop();

// stack elementlarini chiqarish

s.display();

// stack top elementini chiqarish

cout << "\nTop element " << s.peek() << endl;

return 0;

}