- Deque is Double ended queue.
- Supports element insertion and deletion at both ends.
- Deques can also be used as LIFO (Last-In-First-Out)
- When a Deque is used as a stack, elements are pushed and popped from the beginning of the
- deque
Example Implementation:
ArrayDeque<String> deque = new ArrayDeque<String>();
for (Iterator<String> element = deque.iterator(); iter.hasNext(); ) { System.out.println(element.next()); }
Application Ideas:
- To implement Undo-Redo Operations
- To implement Steal Job scheduling Algorithm.
No comments:
Post a Comment