“Ma’lumotlar tuzilmasi va algoritmlar” fanining maqsadi va vazifasi

void Empty(int t)
{
if (t= =0) p=1;
else p=2;
}
void Push(int t, BT x)
{
if (t= =max_st) exit(1);
stack[t]=x;
t++;
}
void Remove(int t)
{
if (t= =0) exit(1);
t--;
return stack[t];
}
void Full(int t)
{
if (t= =max_st) p=1;
else p=2;
}

Navbatdagi asosiy amallar

Faraz qilaylik, navbat bir o‘lchamli massiv ko‘rinishida ifodalangan bo‘lib, uning uzunligi max_q ga teng bo‘lsin, ya’ni queue[max_q]. Bu erda first –navbat boshi, last- navbat oxiri, x esa BT turga tegishli element.

void Empty(int first, last)
{
if (first= =last) p=1;
else p=2;
}
void Insert(int last, BT x)
{
if (last= =max_q) exit(1);
queue[last]=x;
last++;
}
void Remove(int first, last)
{
if (first= =last) exit(1);
first++;
}
void Full(int last)
{
if (last= =max_q) p=1;
else p=2;
}

Dek so‘zi (DEQ - Double Ended Queue) ingliz tilidan olingan bo‘lib, 2 ta chetga ega navbat degan ma’noni bildiradi. Dek ustida bajariladigan amallar

• Chapdan element kiritish.
• O‘ngdan element kiritish.
• Chapdan element chiqarish.
• O‘ngdan element chiqarish.
• Dek bo‘shligini tekshirish.
• Dek to‘laligini tekshirish.

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];
}