 | Session 12 |  |
Deque
A stack is a conceptual structure consisting of a set of homogeneous elements and is based on the principle of the last inserted elements are retrieved first; therefore, this data structure is also known as LIFO (last-in-first-out). It is a commonly used abstract data type with two major operations, namely push and pop. The elements are appended to the end of the deque (push) and are removed (pop) from the end of the stack. In Java, stacks can be presented by the Deque interface. The Deque interface extends the Queue interface. The name deque is short for double ended queue.
// s of the Deque (double-ended queue) interface has functionality of the stack Deque<Integer> s = new ArrayDeque<>(); s.push(1); s.push(2); s.push(3); System.out.print(s.pop()); // 3 System.out.print(s.pop()); // 2 System.out.print(s.pop()); // 1
| Session 12 | |