How to find a predecessor of a minimum element in a linked list implementation of a queue?

后端未结

关注

 0  1826

so i want to find a predecessor of a minimum element in a queue. I have used a linked list implementation of a queue. I have been able to find a minimum element in a queue, but