Implement a queue with following operations:
- removeFirst - remove the first element
- getFirst - get the value of first element
- addLast - append the value to the end of queue.
- getMax - get the maximum value of the queue.
http://effprog.blogspot.in/2010/11/queue-to-find-min-in-o1.html
ReplyDelete