Scribd
Upload
34 views2 pages

Import Public Class Public Static Void New: "First Element - " "First Element - " "/N"

This Java program demonstrates the use of a deque (double-ended queue) data structure. It constructs a deque of integers, adds elements to both ends, and demonstrates methods like peek, poll, size, isEmpty, and clear. It inserts and removes elements from the front and back of the deque, and iterates over the elements to print them out before clearing the deque.

Uploaded by

MuhammadMahmoud
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views2 pages

Import Public Class Public Static Void New: "First Element - " "First Element - " "/N"

This Java program demonstrates the use of a deque (double-ended queue) data structure. It constructs a deque of integers, adds elements to both ends, and demonstrates methods like peek, poll, size, isEmpty, and clear. It inserts and removes elements from the front and back of the deque, and iterates over the elements to print them out before clearing the deque.

Uploaded by

MuhammadMahmoud
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DequeExample.

java

1 import java.util.ArrayDeque;
2
3 public class DequeExample {
4
5 public static void main(String[] args) {
6 // Constructs a deque of integers
7 ArrayDeque<Integer> deque = new ArrayDeque<>();
8
9 // Inserts the specified element at the end of this queue.
10 // deque.add(newElement);
11 deque.add(55);
12 deque.add(11);
13 deque.add(7);
14 deque.add(-5);
15 deque.add(11);
16
17 // Inserts the specified element at the front of this deque.
18 // deque.addFirst(newElement);
19 deque.addFirst(5);
20
21 // Inserts the specified element at the end of this deque.
22 // deque.addLast(newElement);
23 deque.addLast(77);
24
25 /*
26 * Retrieves, but does not remove, the head of this queue, or returns null
if
27 * this queue is empty.
28 */
29 System.out.println("First element --> " + deque.peek());
30 System.out.println("First element --> " + deque.peek() + "\n");
31
32 /*
33 * Retrieves, but does not remove, the first element of this deque, or
returns
34 * null if this deque is empty.
35 */
36 System.out.println("First element --> " + deque.peekFirst());
37 System.out.println("First element --> " + deque.peekFirst() + "\n");
38
39 /*
40 * Retrieves, but does not remove, the last element of this deque, or
returns
41 * null if this deque is empty.
42 */
43 System.out.println("Last element --> " + deque.peekLast());
44 System.out.println("Last element --> " + deque.peekLast() + "\n");
45
46 /*
47 * Retrieves and removes the head of this queue, or returns null if this
queue
48 * is empty.
49 */
50 System.out.println("First element --> " + deque.poll());
51 System.out.println("First element --> " + deque.peek() + "\n");
52
53 /*
54 * Retrieves and removes the first element of this deque, or returns null if
55 * this deque is empty.
56 */
57 System.out.println("First element --> " + deque.pollFirst());
58 System.out.println("First element --> " + deque.peekFirst() + "\n");
59
60 /*
61 * Retrieves and removes the last element of this deque, or returns null if

Page 1
DequeExample.java

this
62 * deque is empty.
63 */
64 System.out.println("Last element --> " + deque.pollLast());
65 System.out.println("Last element --> " + deque.peekLast() + "\n");
66
67 // Returns the number of elements in this queue.
68 System.out.println("Size: " + deque.size() + "\n");
69
70 // Returns true if this deque contains no elements.
71 System.out.println("IS empty? " + deque.isEmpty() + "\n");
72
73 // Iterate over the queue and print all values
74 while (!deque.isEmpty())
75 System.out.println(deque.poll());
76 System.out.println();
77
78 // Returns true if this deque contains no elements.
79 System.out.println("IS empty? " + deque.isEmpty() + "\n");
80
81 // Removes all of the elements from this deque.
82 deque.clear();
83 }
84
85 }
86

Page 2

You might also like