Code:
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
{
protected Node start, end;
public int size;
public linkedList()
{
start = null;
end = null;
size = 0;
}
/* Function to check if list is empty */
public boolean isEmpty()
{
return start == null;
}
/* Function to check size of list */
public int getSize()
{
return size;
}
/* Function to insert an element */
public void insert(int val)
{
Node nptr, ptr, tmp = null;
nptr = new Node(val, null);
boolean ins = false;
if (start == null)
{
start = nptr;
nptr.setLink(start);
end = start;
}
else if (val <= start.getData())
{
nptr.setLink(start);
end.setLink(nptr);
start = nptr;
}
else if (val >= end.getData())
{
end.setLink(nptr);
nptr.setLink(start);
end = nptr;
}
else
{
tmp = start;
ptr = start.getLink();
while (tmp != end)
{
if (val >= tmp.getData() && val <= ptr.getData())
{
tmp.setLink(nptr);
nptr.setLink(ptr);
ins = true;
break;
}
else
{
tmp = ptr;
ptr = ptr.getLink();
}
}
if (ins == false)
{
tmp.setLink(nptr);
}
}
size++;
}
/* Function to delete an element at position */
public void deleteAtPos(int pos)
{
if (pos == 1 && size == 1)
{
start = null;
end = null;
size = 0;
return;
}
if (pos == 1)
{
start = start.getLink();
end.setLink(start);
size--;
return ;
}
if (pos == size)
{
Node ptr = start;
for (int i = 1; i < size - 1; i++)
ptr = ptr.getLink();
ptr.setLink(start);
end = ptr;
size --;
return;
}
Node ptr = start;
pos = pos - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == pos)
{
Node tmp = ptr.getLink();
tmp = tmp.getLink();
ptr.setLink(tmp);
break;
}
ptr = ptr.getLink();
}
size-- ;
}
/* Function to display elements */
public void display()
{
System.out.print("Sorted Circular Singly Linked List = ");
Node ptr = start;
if (size == 0)
{
System.out.print("empty\n");
return;
}
if (start.getLink() == start)
{
System.out.print(start.getData()+ "->"+ptr.getData()+ "\n");
return;
}
System.out.print(start.getData()+ "->");
ptr = start.getLink();
while (ptr.getLink() != start)
{
System.out.print(ptr.getData()+ "->");
ptr = ptr.getLink();
}
System.out.print(ptr.getData()+ "->");
ptr = ptr.getLink();
System.out.print(ptr.getData()+ "\n");
}
}
public class SortedCircularSinglyLinkedList
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
linkedList list = new linkedList();
System.out.println("Sorted Circular Singly Linked List Test\n");
char ch;
/* Perform list operations */
do
{
System.out.println("\nSorted Circular Singly Linked List Operations\n");
System.out.println("1. insert");
System.out.println("2. delete at position");
System.out.println("3. check empty");
System.out.println("4. get size");
int choice = scan.nextInt();
switch (choice)
{
case 1 :
System.out.println("Enter integer element to insert");
list.insert( scan.nextInt() );
break;
case 2 :
System.out.println("Enter position");
int p = scan.nextInt() ;
if (p < 1 || p > list.getSize() )
System.out.println("Invalid position\n");
else
list.deleteAtPos(p);
break;
case 3 :
System.out.println("Empty status = "+ list.isEmpty()+"\n");
break;
case 4 :
System.out.println("Size = "+ list.getSize() +" \n");
break;
default :
System.out.println("Wrong Entry \n ");
break;
}
/* Display List */
list.display();
System.out.println("\nDo you want to continue (Type y or n) \n");
ch = scan.next().charAt(0);
} while (ch == 'Y'|| ch == 'y');
}
}
Output:
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
1
Enter integer element to insert
3
Sorted Circular Singly Linked List = 3->3
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
1
Enter integer element to insert
6
Sorted Circular Singly Linked List = 3->6->3
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
1
Enter integer element to insert
24
Sorted Circular Singly Linked List = 3->6->24->3
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
1
Enter integer element to insert
1
Sorted Circular Singly Linked List = 1->3->6->24->1
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
1
Enter integer element to insert
0
Sorted Circular Singly Linked List = 0->1->3->6->24->0
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
1
Enter integer element to insert
19
Sorted Circular Singly Linked List = 0->1->3->6->19->24->0
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
4
Size = 6
Sorted Circular Singly Linked List = 0->1->3->6->19->24->0
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
2
Enter position
3
Sorted Circular Singly Linked List = 0->1->6->19->24->0
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
2
Enter position
1
Sorted Circular Singly Linked List = 1->6->19->24->1
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
2
Enter position
1
Sorted Circular Singly Linked List = 6->19->24->6
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
2
Enter position
3
Sorted Circular Singly Linked List = 6->19->6
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
2
Enter position
1
Sorted Circular Singly Linked List = 19->19
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
2
Enter position
1
Sorted Circular Singly Linked List = empty
Do you want to continue (Type y or n)
y
Sorted Circular Singly Linked List Operations
1. insert
2. delete at position
3. check empty
4. get size
3
Empty status = true
Sorted Circular Singly Linked List = empty
Do you want to continue (Type y or n)
n
More Java Programs:
