Advanced Search

Posted By

ivvuljak on 11/20/10

Tagged

Versions (?)

Last Edited at 11/20/10 04:03am

Statistics

Viewed 499 times
Favorited by 0 user(s)

Related snippets

507
red_pokazivac.h
480
red_pokazivac.h
451
red_pokazivac.h
496
strukture 3 red_pokazivac.h
512
red_pokazivac.h
505
Cekaonica i pacjenti - red_pokazivac.h
521
red_pokazivac.h
523
red_pokazivac.h
508
red_pokazivac.h

red_pokazivac.h

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

Expand | Embed | Plain Text

Copy this code and paste it in your HTML 
  1. using namespace std;
  2.  
  3. struct tklijent{     
  4.        char ime[15];
  5.        char prezime[20];
  6.        char transakcija[20];
  7.        int god_rodenja;
  8.        int stanje_rac;       
  9. };
  10. typedef tklijent elementtype; 
  11. struct qu {                   
  12.    elementtype value;
  13.    struct qu *next;
  14. };
  15.  
  16. struct que {
  17.    struct qu *front,*rear;
  18. };
  19.  
  20. typedef struct que queue;     
  21. typedef struct qu *element; 
  22.  
  23. bool IsEmptyQ(queue *Q){
  24. 	if (Q->rear == Q->front) return true; 
  25. 	else return false;
  26. }
  27.  
  28. elementtype FrontQ(queue *Q){ 
  29. 	if (IsEmptyQ(Q)){
  30. 		cout << "Red je prazan!" << endl;
  31. 		exit(1);
  32. 	}
  33. 	return Q->front->next->value; 
  34. }
  35.  
  36. void EnqueueQ(elementtype x , queue *Q){ 
  37. 	element novi , prethodni;      
  38. 	novi = new qu;                  
  39. 	novi->value = x;                
  40. 	prethodni = Q->rear;           
  41. 	prethodni->next = novi;         
  42. 	Q->rear = novi;              
  43. }
  44.  
  45. void DequeueQ(queue *Q){ 
  46. 	if (IsEmptyQ(Q)){
  47. 		cout << "Red je prazan!" << endl;
  48. 		exit(1);
  49. 	}
  50. 	element brisi; 
  51. 	brisi = Q->front;       
  52. 	Q->front = brisi->next;  
  53. 	delete(brisi);          
  54. }
  55.  
  56. void InitQ(queue *Q){
  57. 	element e;                
  58. 	e = new qu;                
  59. 	e->next = NULL;           
  60. 	Q->front = Q->rear = e;   
  61. }

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.