public class Deque {private class Node {public int data;public.pdf

0 likes•6 views

The document contains a Java implementation of a deque (double-ended queue) with inner nodes to hold the data. It features methods to insert nodes from either end and to delete nodes from the right end. There are instances of both a basic and a more complex version of the deque class, showcasing various constructor overloads.

Education

public class Deque {
private class Node {
public int data;
public Node leftNode;
public Node rightNode;
private Node(int data) {
this.data = data;
leftNode = null;
rightNode = null;
}
private Node(int data, null, Node rightNode) {
this.data = data;
this.leftNode = null;
this.rightNode = rightNode;
}
private Node(int data, Node leftNode, null) {
this.data = data;
this.leftNode = leftNode;
this.rightNode = null;
}
private Node(int data, Node leftNode, Node rightNode) {
this.data = data;
this.leftNode = leftNode;
this.rightNode = rightNode;
}
}
private Node leftEnd = null;
private Node rightEnd = null;
public Deque() {
}
public void InsertLeft(int data) {
if ((leftEnd == null) && (rightEnd == null)) {
Node item = new Node(data);
leftEnd = item;
rightEnd = item;

} else {
Node item = new Node(data, leftEnd, null);
leftEnd.leftNode = item;
leftEnd = item;
}
}
public int DeleteRight() {
int temp = rightEnd.data;
rightEnd = rightEnd.leftNode;
rightEnd.rightNode = null;
return temp;
}
}
public class Deque {
private class Node {
public int data;
public Node leftNode;
public Node rightNode;
private Node(int data) {
this.data = data;
leftNode = null;
rightNode = null;
}
private Node(int data, Node leftNode, Node rightNode) {
this.data = data;
this.leftNode = leftNode;
this.rightNode = rightNode;
}
}
private Node header = new Node(0);
public Deque() {
}
public void InsertLeft(int data) {
if (header.data == 0) {
Node item = new Node(data);
item.leftNode = item;

$item.rightNode = item; header.leftNode = item; header.rightNode = item; } else { Node item = new Node(data, header.leftNode, header.rightNode); Node old_leftEnd = header.leftNode; old_leftEnd.rightNode = item; Node rightEnd = header.rightNode; temp.leftNode = item; header.leftNode = item; } header.data++; } public Node DeleteRight() { if (header.data == 0 ) { } else { Node old_rightEnd = header.rightNode; Node leftEnd = header.leftNode; // reference to leftEnd Node new_rightEnd = old_rightEnd.rightNode; /* link new rightEnd to leftEnd */ new_rightEnd.leftNode = leftEnd; leftEnd.rightNode = new_rightEnd; header.rightNode = new_rightEnd; } header.data--; } Solution public class Deque { private class Node { public int data; public Node leftNode; public Node rightNode; private Node(int data) { this.data = data; leftNode = null; rightNode = null;$

}
private Node(int data, null, Node rightNode) {
this.data = data;
this.leftNode = null;
this.rightNode = rightNode;
}
private Node(int data, Node leftNode, null) {
this.data = data;
this.leftNode = leftNode;
this.rightNode = null;
}
private Node(int data, Node leftNode, Node rightNode) {
this.data = data;
this.leftNode = leftNode;
this.rightNode = rightNode;
}
}
private Node leftEnd = null;
private Node rightEnd = null;
public Deque() {
}
public void InsertLeft(int data) {
if ((leftEnd == null) && (rightEnd == null)) {
Node item = new Node(data);
leftEnd = item;
rightEnd = item;
} else {
Node item = new Node(data, leftEnd, null);
leftEnd.leftNode = item;
leftEnd = item;
}
}
public int DeleteRight() {
int temp = rightEnd.data;
rightEnd = rightEnd.leftNode;
rightEnd.rightNode = null;

$return temp; } } public class Deque { private class Node { public int data; public Node leftNode; public Node rightNode; private Node(int data) { this.data = data; leftNode = null; rightNode = null; } private Node(int data, Node leftNode, Node rightNode) { this.data = data; this.leftNode = leftNode; this.rightNode = rightNode; } } private Node header = new Node(0); public Deque() { } public void InsertLeft(int data) { if (header.data == 0) { Node item = new Node(data); item.leftNode = item; item.rightNode = item; header.leftNode = item; header.rightNode = item; } else { Node item = new Node(data, header.leftNode, header.rightNode); Node old_leftEnd = header.leftNode; old_leftEnd.rightNode = item; Node rightEnd = header.rightNode; temp.leftNode = item; header.leftNode = item;$

$} header.data++; } public Node DeleteRight() { if (header.data == 0 ) { } else { Node old_rightEnd = header.rightNode; Node leftEnd = header.leftNode; // reference to leftEnd Node new_rightEnd = old_rightEnd.rightNode; /* link new rightEnd to leftEnd */ new_rightEnd.leftNode = leftEnd; leftEnd.rightNode = new_rightEnd; header.rightNode = new_rightEnd; } header.data--; }$

More Related Content

Similar to public class Deque {private class Node {public int data;public.pdf (20)

PDF

Create a new java class called ListNode. Implement ListNode as a gen.pdfmohamednihalshahru

PDF

Copy your completed LinkedList class from Lab 3 into the LinkedList..pdffacevenky

PDF

A deque (pronounced deck) is an ordered set of items from which item.pdfhardjasonoco14599

PDF

I need help implementing a Stack with this java programming assignme.pdfsauravmanwanicp

PDF

JAVA A double-ended queue is a list that allows the addition and.pdfamrishinda

PDF

Introduction and BackgroundIn recent lectures we discussed usi.pdfarpitaeron555

PDF

public class TrequeT extends AbstractListT { .pdfinfo30292

PDF

Using visual studio 2022- a C# windows form application- and your Doub.pdfacteleshoppe

PDF

Collections Framework Beginners Guide 2Kenji HASUNUMA

PDF

Collections Framework Begineers guide 2Kenji HASUNUMA

PDF

Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdffreddysarabia1

PDF

Here is the editable codeSolutionimport java.util.NoSuchEleme.pdfarrowmobile

PDF

STAGE 2 The Methods 65 points Implement all the methods t.pdfbabitasingh698417

PDF

Help I keep getting the same error when running a code. Below is the.pdfmail931892

PDF

PLEASE MAKE SURE THE PROGRAM IS ASKING FOR INPUT FROM USER TO ADD OR.pdfmallik3000

PDF

public class DoubleArraySeq implements Cloneable { Priva.pdfannaimobiles

PDF

public class MyLinkedListltE extends ComparableltEgtg.pdfaccostinternational

PDF

I keep getting NullPointerExcepetion, can someone help me with spinL.pdfarkmuzikllc

PDF

For each task, submit your source java code file.(1) Objective Im.pdfdhavalbl38

PDF

File LinkedList.java Defines a doubly-l.pdfConint29