Stek navbat dek

Dekdagi asosiy amallar

int kirit_right(int s){

if(isFull()){cout<<"\n dek to'ldi";n=R;return EXIT_SUCCESS;}

a[R]=s;R++;

}

bool isEmpty(){

if(R==0) return true; else return false;

}

bool isFull(){

if(R>=10) return true; else return false;

}

int olish_right(){

if(isEmpty()){cout<< "\n dek bo'sh";return EXIT_SUCCESS;}

R--;

return a[R];

}

Dekdagi asosiy amallar

int kirit_left(int s){

if(isFull()){cout<< "\n dek to'ldi";n=R; return EXIT_SUCCESS;}

for(int i=R;i>0;i--)

a[i]=a[i-1];

a[0]=s;R++;

}

int olish_left(){

if(isEmpty()){cout<< "\ndek bo'sh";return EXIT_SUCCESS;}

int t=a[0];

for(int i=0;i

a[i]=a[i+1];

R--;

return t;

}

Navbatni bog’langan ro’yhat ko’rinishida tasvirlash

Stekni bog’langan ro’yhat ko’rinishida tasvirlash

Stekka element kiritish algoritmi

• 1. yangi element yaratish
• 2. uning info maydoniga ma’lumot kiritish
• 3. agar ro’yhat bo’sh bo’lsa, ro’yhat boshi ko’rsatkichini ushbu elementga to’g’irlaymiz va yangi element ptr maydoniga NULL yozamiz, ya’ni if(Lst==NULL){Lst=p; p->ptr=NULL}

Lst

4. Aks holda, ya’ni ro’yhat bo’sh bo’lmasa, yangi yaratilayotgan element ptr maydoniga ro’yhatning 1-elementi adresini yozamiz: p->ptr = Lst; 5. ro’yhat boshi ko’rsatkichini yangi elementga tog’irlaymiz. Lst=p;

Stekka element kiritish dasturi

• class Node{
• public: int info;
• Node* ptr; };
• int main()
• { Node* Lst = NULL;
• Node* p = new Node;
• int numb; cout<<"son kiriting: ";
• cin>>numb;
• p->info = numb;
• p->ptr = Lst;
• Lst = p;

Stekdan element chiqarish dasturi

• Node* p = new Node;
• if (Lst == NULL)
• cout<<"ro'yhat bo'sh";
• else { p = lst;
• lst = p->next ;
• delete(p);
• }

Mavzu bo‘yicha nazorat savolari

• Ro‘yxat deb nimaga aytiladi?
• Ro‘yxat turlarini aytib o‘ting.
• Navbat bilan stek qanday ma’lumotlar tuzilmasiga kiradi?
• Stekdan elementni tanlash qanday amalga oshiriladi?
• Qanday xizmat ko‘rsatish turiga FIFO, qaysi biriga LIFO deb ataladi?
• Navbat turlarini keltirib o‘ting.
• Dekning o‘ziga xosligi nimadan iborat?