public class MyDoublyLinkedCircularList {

class List{

}
static Node start;

static class Node

{
int getData;
Node getNext;
Node getPrev;
}

static void insertEnd(int value)

{

if (start == null)
{
Node node = new Node();
node.getData = value;
node.getNext = node.getPrev = node;
start = node;
return;
}

Node last = (start).getPrev;

Node node = new Node();
node.getData = value;
node.getNext = start;
(start).getPrev = node;
node.getPrev = last;
last.getNext = node;
}

static void insertBegin(int value)

{

Node last = (start).getPrev;

Node node = new Node();

node.getData = value;
node.getNext = start;
node.getPrev = last;
last.getNext = (start).getPrev = node;
start = node;
}

static void insertAfter(int value1,int value2)

{
Node node = new Node();
node.getData = value1;
Node temp = start;
while (temp.getData != value2)
temp = temp.getNext;
Node next = temp.getNext;
temp.getNext = node;
node.getPrev = temp;

This study source was downloaded by 100000851302356 from CourseHero.com on 08-30-2022 04:33:08 GMT -05:00

https://www.coursehero.com/file/106719560/MyDoublyLinkedCircularListjava/
 node.getNext = next;
next.getPrev = node;
}

static void setNext()

{
Node node = start;

System.out.println();
while (node.getNext != start)
{
System.out.printf("%d ", node.getData);
node = node.getNext;
}
System.out.printf("%d ", node.getData);

System.out.println();
Node last = start.getPrev;
node = last;
while (node.getPrev != last)
{
System.out.printf("%d ", node.getData);
node = node.getPrev;
}
System.out.printf("%d ", node.getData);
}

public static void main(String[] args)

{
Node start = null;
insertEnd(5);
insertBegin(4);
insertEnd(7);
insertEnd(8);
insertAfter(6, 5);
System.out.printf("Circular doubly linked list: ");
setNext();
}
}

This study source was downloaded by 100000851302356 from CourseHero.com on 08-30-2022 04:33:08 GMT -05:00

https://www.coursehero.com/file/106719560/MyDoublyLinkedCircularListjava/
Powered by TCPDF (www.tcpdf.org)