LinkedList.java

public class LinkedList {

    private Node head = new Node(null, 0);

    public Node getHead() {
        return head;
    }

    //returns the length of the list
    public int size(){
        int length = 0;
        while (this.head.getNext() != null){
            this.head = this.head.getNext();
            length++;
        }
        return length;
    }

    public void make_Empty(){
       Node temp = this.head;
       temp.setNext(null);

    }

    public String turn_into_string(){
        Node finallistcur = this.getHead().getNext();
        StringBuilder sb = new StringBuilder();
        while (finallistcur != null){
            sb.insert(0, finallistcur.getKey());
            finallistcur = finallistcur.getNext();
        }
        String final_string = sb.toString();
        return final_string;
    }
    //returns true if list is empty, meaning head.getNext() == null
    public boolean isEmpty(){
        if (head.getNext() == null){
            return true;
        }

        return false;
    }

    //adds a new node with the inputted value
    //if list is empty meaning head.getNext() == null then head.next is set to new node
    /*if list not empty, uses while loop to traverse list be continuously checking next value for a null.
    Once a null is found for the next node, the node current is set to the new node for its next value
     */
    public void add(int value){
        Node node = new Node(null, value);
        if (this.isEmpty()){
            this.head.setNext(node);

        }
        else {
            Node finalspot = this.head;
            while (finalspot.getNext() != null){
                finalspot = finalspot.getNext();
            }
            finalspot.setNext(node);

        }
    }




}