I need a Generic circularly linked list in java with a Generic node class please

Question

I need a Generic circularly linked list in java with a Generic node class please =).

Explanation / Answer

* * Java Program to Implement Circular Singly Linked List */ import java.util.Scanner; /* Class Node */ class Node { protected int data; protected Node link; /* Constructor */ public Node() { link = null; data = 0; } /* Constructor */ public Node(int d,Node n) { data = d; link = n; } /* Function to set link to next Node */ public void setLink(Node n) { link = n; } /* Function to set data to current Node */ public void setData(int d) { data = d; } /* Function to get link to next node */ public Node getLink() { return link; } /* Function to get data from current Node */ public int getData() { return data; } } /* Class linkedList */ class linkedList { protected Node start ; protected Node end ; public int size ; /* Constructor */ public linkedList() { start = null; end = null; size = 0; } /* Function to check if list is empty */ public boolean isEmpty() { return start == null; } /* Function to get size of the list */ public int getSize() { return size; } /* Function to insert element at the begining */ public void insertAtStart(int val) { Node nptr = new Node(val,null); nptr.setLink(start); if(start == null) { start = nptr; nptr.setLink(start); end = start; } else { end.setLink(nptr); start = nptr; } size++ ; } /* Function to insert element at end */ public void insertAtEnd(int val) { Node nptr = new Node(val,null); nptr.setLink(start); if(start == null) { start = nptr; nptr.setLink(start); end = start; } else { end.setLink(nptr); end = nptr; } size++ ; } /* Function to insert element at position */ public void insertAtPos(int val , int pos) { Node nptr = new Node(val,null); Node ptr = start; pos = pos - 1 ; for (int i = 1; i list.getSize() ) System.out.println("Invalid position "); else list.deleteAtPos(p); break; case 5 : System.out.println("Empty status = "+ list.isEmpty()); break; case 6 : System.out.println("Size = "+ list.getSize() +" "); break; default : System.out.println("Wrong Entry "); break; } /* Display List */ list.display(); System.out.println(" Do you want to continue (Type y or n) "); ch = scan.next().charAt(0); } while (ch == 'Y'|| ch == 'y'); } } Circular Singly Linked List Test Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 5 Empty status = true Circular Singly Linked List = empty Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 1 Enter integer element to insert 4 Circular Singly Linked List = 4->4 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 1 Enter integer element to insert 1 Circular Singly Linked List = 1->4->1 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 2 Enter integer element to insert 3 Circular Singly Linked List = 1->4->3->1 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 2 Enter integer element to insert 7 Circular Singly Linked List = 1->4->3->7->1 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 3 Enter integer element to insert 24 Enter position 3 Circular Singly Linked List = 1->4->24->3->7->1 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 6 Size = 5 Circular Singly Linked List = 1->4->24->3->7->1 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 4 Enter position 1 Circular Singly Linked List = 4->24->3->7->4 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 1 Enter integer element to insert 2 Circular Singly Linked List = 2->4->24->3->7->2 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 4 Enter position 1 Circular Singly Linked List = 4->24->3->7->4 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 4 Enter position 2 Circular Singly Linked List = 4->3->7->4 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 4 Enter position 3 Circular Singly Linked List = 4->3->4 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 4 Enter position 1 Circular Singly Linked List = 3->3 Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 4 Enter position 1 Circular Singly Linked List = empty Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 4 Enter position 3 Invalid position Circular Singly Linked List = empty Do you want to continue (Type y or n) y Circular Singly Linked List Operations 1. insert at begining 2. insert at end 3. insert at position 4. delete at position 5. check empty 6. get size 5 Empty status = true Circular Singly Linked List = empty Do you want to continue (Type y or n) n

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.