/ Published in: C++
strukture podataka - zadatak 3
Expand |
Embed | Plain Text
Copy this code and paste it in your HTML
#include <cstdlib> #include <iostream> using namespace std; struct tpopis{ int red_br; int prvi; int drugi; int pok; }; struct t{ tpopis popis; t *sljedeci; }; struct r{ t *front, *rear; }; void initq(r *red){ red->front=(t*)malloc(sizeof(t));//alociranje pokazivaA?i?1A???????????????????1a front red->front->sljedeci=NULL; red->rear=red->front; cout<<"Red je inicijaliziran"<<endl; }; bool isemptyq(r *red){ if(red->front==red->rear) return true; else return false; }; void enqueueq(tpopis prvi,r *red){ t *pom; pom=new t; pom->popis=prvi; pom->sljedeci=NULL; red->rear->sljedeci=pom; red->rear=pom; }; void dequeueq(r *red){ t *pom; if(isemptyq(red)) cout<<"Red je prazan"; else{ pom=red->front; red->front=red->front->sljedeci; free(pom); } }; tpopis frontq(r *red){ if(isemptyq(red)) cout<<"Red je prazan"; else return (red->front->sljedeci->popis); };