CODEWITHSUNDEEP
javaalgorithmdata-structureslinked-listsingly-linked-list
Michael
Michael

Reputation: 3

Java Simple Linked List

I am taking a course in Data Structures at University and I am having troubles understanding why my Singly Linked List is not following FIFO algorithm.

Here is my Node/PSVM class:

public class Node {

    protected int data;
    protected Node next;

    Node(int element){
        this.data = element;
        next = null;
    }



    public static void main(String[] args) {
        LinkedList ll = new LinkedList();

        ll.addElement(300);
        ll.addElement(600);
        ll.addElement(900);
        ll.addElement(1200);


        ll.printList();
    }
}

This is my Linked List Class:


public class LinkedList {

    // create a reference of type node to point to head
    Node head;

    // keep track of the size of ll
    int size = 0;

    void printList() {
        Node n = head;

        for (int i = 0; i < llSize(); i++) {
            System.out.print(n.data + " ");
            n = n.next;

        }
        System.out.println("");
    }


    int llSize() {
        return this.size;
    }

    boolean isEmpty() {
        return size == 0;
    }

    void addElement(int element) {

        if (isEmpty()) {
            head = new Node(element);

        } else {
            Node nNode = new Node(element);
            Node current = head;

            while(current.next != null){
                current = current.next;
            }

            current.next = nNode;

        }

        this.size++;

    }


}

Sorry in advance if this is a basic question/problem. I have asked my professor and she sent me a YouTube link which really didn't help.

Thank you for your time.

Upvotes: 0

Views: 126

Answers (1)

Deepak Tatyaji Ahire
Deepak Tatyaji Ahire

Reputation: 5309

The code has no bugs.

For the list to behave as FIFO, nodes will be added to one end and deleted from the opposite end.

Therefore, you will have to implement a delete operation. You can maintain separate reference to the head and tail node.

Upvotes: 1

Related Questions