Java Deque Interface Tutorial
Deck is an acronym for Double Ended Queue, meaning it supports the insertion and deletion of elements
from both ends. Deck is an interface that can be implemented by an Array Deck or a Linked List. Deck can
be used as a Queue, a Stack, or a FIFO data structure.
To create an object, we need to use an Array Deck or a Linked List with the "new" keyword. Linked List is a
dynamic array that initially allocates some size and resizes itself whenever it reaches up to 70 or 80
percent.
To add an element in a Deck, we can use "add" which adds the element at the end of a queue or "offer
first". A Deck is a FIFO data structure, so it can be used as a Queue. Therefore, this is an interface and can
be implemented using different data structures such as Array Deck or Linked List.
The topmost interface is the iterator, which allows us to iterate over a collection. We can use the for-each
statement to insert three elements, and by using either an iterator or for-each, we can print the elements
present in this data structure.
An effi cient way to check whether a collection is a palindrome or not is to take two pointers.
Deck is an acronym for Double Ended Queue, meaning it supports the insertion and deletion of elements
from both ends. Deck is an interface that can be implemented by an Array Deck or a Linked List. Deck can
be used as a Queue, a Stack, or a FIFO data structure.
To create an object, we need to use an Array Deck or a Linked List with the "new" keyword. Linked List is a
dynamic array that initially allocates some size and resizes itself whenever it reaches up to 70 or 80
percent.
To add an element in a Deck, we can use "add" which adds the element at the end of a queue or "offer
first". A Deck is a FIFO data structure, so it can be used as a Queue. Therefore, this is an interface and can
be implemented using different data structures such as Array Deck or Linked List.
The topmost interface is the iterator, which allows us to iterate over a collection. We can use the for-each
statement to insert three elements, and by using either an iterator or for-each, we can print the elements
present in this data structure.
An effi cient way to check whether a collection is a palindrome or not is to take two pointers.
