/* This is the node class */ /** * * @author JJ */ public class Node { Node next; Integer getInt, getFtNum, getInchNum; Double getDouble; //This is the default constructor public Node() { next = null; } //One parameter constructor public Node(Node n) { next = n; } //A two parameter Integer constructor public Node(Node n, Integer getEle) { next = n; getInt = getEle; } //Return the next Node public Node getNext() { return next; } }

/* This is the sortedLinked List */ /** * * @author JJ */ public class SortedLinkedList { Node head; int size = 0; int index=0; //Returns the appropriate position of the Integer node public Node AppropriatePosition(Integer getNum) { Node previous, current; previous= null; current= head; if(current == null || head.getInt.compareTo(getNum)>0) { return previous; } while (current.next != null) { if(current.next.getInt.compareTo(getNum)>0) break; current = current.next; } current.next = new Node(current.next, getNum); return current; } //Inserting the element into the node public Node insert(Integer ele) { Node temp_post, temp, temp_head = head; temp_post = AppropriatePosition(ele); temp = new Node(head, ele); if(temp_post==null) { head = temp; } while(temp_post != null) { temp_head = temp; temp_post = temp_post.next; } return head; } //This is the Integer delete method public Node delete(Integer n) { Node current = head; Node previous; int i = size; Node getFind = find(n); previous = null; if(getFind==null) { System.out.println("Element is not found"); return head; } if(getFind==null && i==1) { head = null; size--; return head; } else { while(current != null) { if(current.getInt >= getFind.getInt && current.getInt <= getFind.getInt) { if(previous==null && i > 1) { previous = current.next; } else { previous.next = current.next; } } else { previous = current; } current = current.next; } } return current; } //It finds the target position in the node public Node find(Integer number) { Node current = head; while(current != null) { if(current.getInt.compareTo(number)>=0 && current.getInt.compareTo(number)<= 0) { size--; break; } current = current.next; } return current; } //Clear the list public Node clear() { return null; } //Make the list empty public Node isEmpty() { size = 0; if(head==null) { System.out.println("The list is already empty"); System.out.println("The list size is: " + size + "\n"); return null; } else head = clear(); System.out.println("The list size is: " + size + "\n"); return head; } //Printing the smallest element in the List public void smallest() { Node smallTemp = head; if(smallTemp == null) { System.out.println("There are no element in the list yet"); System.out.println("The list size is: "+ size); } else { System.out.println("Smallest is: " + smallTemp.getInt + "\n"); System.out.println("The list size is: " + size + "\n"); } } //Printing out the largest element in the list public void largest() { Node largeTemp = head; if(largeTemp==null) { System.out.println("There are no element in the list yet"); System.out.println("The list size is: " + size + "\n"); } else { while(largeTemp.next != null) { largeTemp = largeTemp.next; } System.out.println("The largest is " + largeTemp.getInt + "\n"); System.out.println("The list size is: " + size + "\n"); } } //Prints out the list public void display() { Node temp = head; while(temp != null) { System.out.println(temp.getInt); temp = temp.next; } System.out.println("The list size is: " + size + "\n"); } }

/* This is the Integer driver */ /** * * @author JJ */ import java.util.*; public class IntDriver { public static void main(String[] args) { Scanner key = new Scanner(System.in); //Create an SortelinkedList object SortedLinkedList sList = new SortedLinkedList(); int choice; try { //This is the menu selection do { System.out.println("1) Insert 2) Delete 3) Clear 4) Smallest " + "5) Largest 6) Exit "); System.out.print("\nEnter your selection:"); choice = key.nextInt(); if(choice==1) { Integer getEle; System.out.print("Enter an integer: "); getEle = key.nextInt(); sList.insert(getEle); System.out.println(" "); sList.size++; sList.display(); } if(choice ==2) { Integer deleEle; System.out.print("Enter a element: "); deleEle = key.nextInt(); sList.delete(deleEle); sList.display(); } if(choice==3) { sList.isEmpty(); } if(choice==4) { sList.smallest(); } if(choice==5) { sList.largest(); } if(choice==6) { System.out.println("Thank YOU"); System.exit(0); } }while(choice != 6); } catch(InputMismatchException e) { System.out.println("Invalid Inputs"); } } }