04 mavzu shokirov shodmon shoyimovich informatika asoslari kafedrasi assistenti Mа’ruza rejasi

Stekni amalga oshirish (massiv)

• Struktura-stek:

• const MAXSIZE = 100;
• struct Stack {
• char data[MAXSIZE]; // 100 ta simvolli stek
• int size; // elementlar soni
• };

• Element qo’shish:

• int Push ( Stack &S, char x )
• {
• if ( S.size == MAXSIZE ) return 0;
• S.data[S.size] = x;
• S.size ++;
• return 1;
• }

• xatolik: stekni to’ldirish

• Element qo’shish

• Xatolik yo’q

• Stekni amalga oshirish (massiv)

• char Pop ( Stack &S )
• {
• if ( S.size == 0 ) return char(255);
• S.size --;
• return S.data[S.size];
• }

• Boshidan elementni o’chirish:

• Bo’shmi yoki yo’q?

• int isEmpty ( Stack &S )
• {
• if ( S.size == 0 )
• return 1;
• else return 0;
• }

• xatolik: stek bo’sh

• int isEmpty ( Stack &S )
• {
• return (S.size == 0);
• }

• Stek

• Universal stek har bir tuguni axborot qismi void turidagi ko’rsatkichdan iborat strukturadir

• struct slist_node
• {
• void* info;
• struct slist_node* pred;
• };

• Stek tuguni ro’yxat tugunidan farqi shundaki ,
• o’zidan oldingi tugun adresini saqlovchi ko’rsatkich ishlatilgan.

• Stek

• Stek o’zi alohida struktura sifatida kiritilgan

• struct stack
• {
• struct slist_node* end;
• int size;
• int width;
• };

• stackda end oxirgi tugunga ko’rsatkich, width ma’lumot hajmi, size navbatdagi elementlar soni.

•