Posted By


renata on 11/20/10

Tagged


Statistics


Viewed 77 times
Favorited by 0 user(s)

RED_strukture_podataka


/ Published in: C++
Save to your folder(s)



Copy this code and paste it in your HTML
  1. #include<iostream>
  2. #include<cstring>
  3. using namespace std;
  4. typedef int element;
  5. struct red{
  6. char ime_prezime[30];
  7. int g_rodenja;
  8. float stanje_racun;
  9. char transakcija[20];
  10. };
  11. struct ttred{
  12. red r[1000];
  13. ttred *sljedeci;
  14. };
  15. struct tred{
  16. ttred *front;
  17. ttred *rear;
  18. };
  19. ttred tr;
  20. red r;
  21. typedef struct red queue;
  22. queue* FrontQ(tred *td){
  23. td=new tred;
  24. td->front->sljedeci=NULL;
  25. return td->front->sljedeci->r;
  26. }
  27.  
  28. int EnQueueQ(char ip[],int g,float sr,char tr[],tred *ta){
  29. ta=new tred;
  30. ta->rear->sljedeci=NULL;
  31. strcpy(ta->rear->r->ime_prezime,ip);
  32. ta->rear->r->g_rodenja=g;
  33. ta->rear->r->stanje_racun=sr;
  34. strcpy(ta->rear->r->transakcija,tr);
  35. }
  36. int DeQueueQ(tred *td){
  37. ttred *brisi;
  38. brisi=td->front;
  39. td->front->sljedeci=td->front;
  40. delete brisi;
  41. cout << "Prvi element je izbrisan iz reda!" << endl;
  42. }
  43.  
  44. bool IsEmptyQ(tred *td){
  45. if(td->front->sljedeci==NULL)return true;
  46. else return false;
  47. }
  48. int InitQ(tred *td){
  49. td->front=NULL;
  50. td->rear=NULL;
  51. cout << "Red je prazan!" << endl;
  52. }

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.