Question

public void add(linked list, int data){
Node node = new Node(data);
node.next=null;
node.prev=null;
if(list.head==null){
list.head=node;
}
else{
Node n = list.head;
Node temp = list.head;
while(n.next!=null){

n=n.next;
n.prev=temp;
temp=temp.next;
}


n.next=node;
node.prev=n;


System.out.println(node.prev + " " + n.data);
}

}

How can i turn this doubly linked list into a circular doubly linkedlist, using java

Answer 1

//Java program

public void add(linked list, int data){
//if list is empty
       if(list.head==null){
           Node node = new Node(data);
           node.next=node;
           node.prev=node;
           list.head=node;
           return ;
       }
       Node last = list.head.prev;
       Node node = new Node(data);
  
   // Start is going to be next of new_node
   node.next = list.head;
  
   // Make new node previous of start
   (list.head).prev = node;
  
   // Make last previous of new node
   node.prev = last;
  
   // Make new node next of old last
   last.next = node;
      
       System.out.println(node.prev + " " + last.data);
       }