Sorted list : Custom List « Collections Data Structure « Java

1. Java
2. Collections Data Structure
3. Custom List

Sorted list

 
public class SortedList {
  private Link first; 

  public SortedList() {
    first = null;
  }

  public boolean isEmpty(){
    return (first == null);
  }

  public void insert(long key){
    Link newLink = new Link(key); 
    Link previous = null; 
    Link current = first;

    while (current != null && key > current.data) {
      previous = current;
      current = current.next;
    }
    if (previous == null)
      first = newLink; 
    else
      previous.next = newLink; 
    newLink.next = current; 
  }

  public Link remove() { 
    Link temp = first; 
    first = first.next;
    return temp; 
  }

  public void displayList() {
    System.out.print("List: ");
    Link current = first; 
    while (current != null){
      current.displayLink(); 
      current = current.next;
    }
    System.out.println("");
  }

  public static void main(String[] args) { 
    SortedList theSortedList = new SortedList();
    theSortedList.insert(20); 
    theSortedList.insert(40);

    theSortedList.displayList(); 

    theSortedList.insert(10); 
    theSortedList.insert(30);
    theSortedList.insert(50);

    theSortedList.displayList(); 

    theSortedList.remove(); 

    theSortedList.displayList(); 
  } 
  class Link {
    public long data; 
  
    public Link next; 
  
    public Link(long dd) {
      data = dd;
    }
  
    public void displayLink() {
      System.out.print(data + " ");
    }
  }
}
           
         
  

Related examples in the same category

1.	Redundancy Checker
2.	Doubly-linked list with data structure
3.	List with first and last references
4.	Frist last list
5.	Another Link list
6.	A growable array of int values, suitable for use with multiple threads
7.	Implements a "rolling list".