Advanced Search

Posted By

jakljunic on 11/20/10

Tagged

Versions (?)

Last Edited at 11/20/10 07:21am

Statistics

Viewed 22 times
Favorited by 0 user(s)

Zadatak_3_red_pokazivaci_jakljunic

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

Expand | Embed | Plain Text

Copy this code and paste it in your HTML 
  1. struct qu {
  2. 	   elementtype value;
  3. 	   struct qu *next;
  4. };
  5.  
  6. struct que {
  7. 	   struct qu *front, *rear;
  8. };
  9.  
  10. typedef struct que queue;
  11. typedef struct qu *element;
  12.  
  13. elementtype FrontQ(queue *Q){
  14. 	        if (Q->front==Q->rear)
  15. 	           cout << "Red je prazan";
  16.             else
  17.                 return ((Q->front)->next)->value;
  18. }
  19.  
  20. void EnqueueQ(elementtype x, queue *Q){
  21. 	 element e = new qu;
  22. 	 e->value = x;
  23. 	 e->next = NULL;
  24. 	 (Q->rear)->next = e;
  25. 	 Q->rear = e;
  26. }
  27.  
  28. void DequeueQ(queue *Q){
  29. 	 element e;
  30. 	 if (Q->front==Q->rear)
  31.         cout << "Red je prazan";
  32. 	 else{
  33. 	      e = Q->front;
  34.           Q->front = (Q->front)->next;
  35.           delete e;
  36.      }
  37. }
  38.  
  39. bool IsEmptyQ(queue *Q){
  40.      if (Q->front==Q->rear)
  41.         return true;
  42.      else
  43. 	     return false;
  44. }
  45.  
  46. void InitQ(queue *Q){
  47. 	 element e = new qu;
  48.      Q->front = e;
  49.      Q->rear = e;
  50.      e->next = NULL;
  51. }

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.