|
8-Mavzu: Stek va navbatlar To‘plam
|
| bet | 5/5 | | Sana | 07.11.2023 | | Hajmi | 0.52 Mb. | | #95008 |
Bog'liq 8-Mavzu Reja Diniy va milliy qadriyatlarning tiklanishi-azkurs.org, КРОССВОРД НА ТЕМУ СТОМАТОЛОГИЯ, ingliz tili yakuniy, 7 t amaliy fizika, 6 amaliy mashgulot, 5 amaliy, Muslim 0123, Axborot-texnologiyalari-Kadirov (1), Malumotlar bazasi fanidan Mustaqil ish (1), Mundarij a kirish I bob. Gap bo‘laklari haqida umumiy ma’lumotla-fayllar.org, Polynomial, глоссарий, aiahhashhshsshhshshsgsg, psixologiya mustaqil ish
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;
}
- 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){ p->ptr=NULL; Lst=p}
Lst 4. Aks holda, ya’ni ro’yhat bo’sh bo’lmasa, yangi yaratilayotgan element ptr maydoniga ro’yhatning 1-elementi adresinni 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);
- }
|
| |
