Scribd
Upload
15 views2 pages

Java Code

The document contains a Java implementation of a Doubly Linked List, including the definition of the DoublyLinkedListNode class and the DoublyLinkedList class. It provides methods for inserting and removing nodes from both the front and the end of the list, as well as a method for printing the list. The implementation initializes a head and tail node to facilitate operations on the list.

Uploaded by

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

Java Code

The document contains a Java implementation of a Doubly Linked List, including the definition of the DoublyLinkedListNode class and the DoublyLinkedList class. It provides methods for inserting and removing nodes from both the front and the end of the list, as well as a method for printing the list. The implementation initializes a head and tail node to facilitate operations on the list.

Uploaded by

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

/*

public class DoublyLinkedListNode {

int val;
DoublyLinkedListNode next;
DoublyLinkedListNode prev;

public DoublyLinkedListNode(int val) {


[Link] = val;
[Link] = null;
[Link] = null;
}
}
*/

// Implementation for Doubly Linked List


public class DoublyLinkedList {
DoublyLinkedListNode head;
DoublyLinkedListNode tail;

public DoublyLinkedList() {
head = new DoublyLinkedListNode(-1);
tail = new DoublyLinkedListNode(-1);
[Link] = tail;
[Link] = head;
}

public void insertFront(int val) {


DoublyLinkedListNode newNode = new DoublyLinkedListNode(val);
[Link] = head;
[Link] = [Link];

[Link] = newNode;
[Link] = newNode;
}

public void insertEnd(int val) {


DoublyLinkedListNode newNode = new DoublyLinkedListNode(val);
[Link] = tail;
[Link] = [Link];

[Link] = newNode;
[Link] = newNode;
}

public void removeFront() {


[Link] = head;
[Link] = [Link];
}

public void removeEnd() {


[Link] = tail;
[Link] = [Link];
}

public void print() {


DoublyLinkedListNode curr = [Link];
while (curr != tail) {
[Link]([Link] + " -> ");
curr = [Link];
}
[Link]();
}
}

You might also like