Ace Programming and DS

Question

Answer 1

you are implementing circular queue, 

property of circular queue is last node should points to first node means, rear->link=front.

for better understanding, let new node = A

a new node is inserted at last, therefore

1) A = new node()  =====>  Rear -> link = new node()

 

update its value

2) A->data = x;  =====>  Rear -> link ->data = x; 

 

last element, next pointer should points to front

3) A->link = front  =====> rear->link->link = front

 

therefore your last element changed, therefore you have to change the pointer

4) rear=A =====> rear=rear->link

---

a new node is inserted at last, therefore

1) A = new node()  =====>  Rear -> link = new node()

 

update its value

2) A->data = x;  =====>  Rear -> link ->data = x; 

 

therefore your last element changed, therefore you have to change the pointer

3) rear=A =====> rear=rear->link

 

last element, next pointer should points to front

4) A->link = front  =====> rear->link = front

Comments

Good explanation. But i guess by mistake you written the same thing twice. 

a new node is inserted at last, therefore

1) A = new node()  =====>  Rear -> link = new node()

 

update its value

2) A->data = x;  =====>  Rear -> link ->data = x; 

 

therefore your last element changed, therefore you have to change the pointer

3) rear=A =====> rear=rear->link

 

last element, next pointer should points to front

3) A->link = front  =====> rear->link = front

---

no i just repeat the the number 3 only by mistake... i will update

 

there are two possibilities, check again 3 and 4 points in both procedues.