Vektorlar va ko’p o’lchovli massivlar bilan ishlash, ro‘yxat, navbat va stek Ma’ruza rejasi

void pop(struct stack*p) – stek oxiridagi elementni o‘chirish.

void push(struct stack*p, void* val) –stek oxiriga element qo‘shish. Bu yerda val kiritilayotgan ma’lumotga ko‘rsatkich.

char* top(struct stack p) – stek oxiridagi tugun axborot qismiga ko‘rsatkich qaytarish.

int empty(struct stack p) – stek bo‘shligini tekshirish.

int size (struct stack p) – stek elementlari soni.

Bundan tashqari stekni inisiallash uchun quyidagi sarlavhali funksiya kiritilgan

void ini_stack (struct stack* p,int n) - Bu yerda n kiritilayotgan ma’lumotlar hajmi.

#include

#include

#include

#include

struct slist_node

{

void* info;

struct slist_node* pred;

};
struct stack

{

struct slist_node* end;

int size;

int width;

};
void pop(struct stack*p)

{

struct slist_node* p1 = p->end;

if (p->size>0)

{

p->end = p1->pred;

free(p1);

p->size--;

}

}
void push(struct stack*p, void* val)

{

struct slist_node* p1 = (struct slist_node*)malloc(sizeof(struct slist_node));

p1->info = malloc(p->width);

memcpy(p1->info,val,p->width);

if(p->size == 0)

{

p->end = p1;

}

else

{

p1->pred = p->end;

p->end = p1;

}

p->size++;

}
char* top(struct stack p)

{
return p.end->info;

}
int size(const struct stack* p)

{

return p->size;

}
int empty(struct stack p)

{

if (p.size>0) return 0;else return 1;

}

void ini_stack(struct stack* p,int n)

{

p->end = NULL;

p->size = 0;

p->width = n;

}

int main()

{

int i,m;

int*pi;

struct stack ps;

ini_stack(&ps,sizeof(int));

for(i = 0;i<5;i++) push(&ps,&i);

while(!empty(ps))

{

pi = (int*)top(ps);

printf("%d ",*pi);

pop(&ps);

}

getch();

return 0;

}

Namuna. Agar stekka kiruvchi yonma-yon turgan elementlari teng bo‘lsa ularni o‘chiring va “Yes”, aks holda “No” chiqaring.