Java Community | Help. Code. Learn.•15mo ago

Linked List Nodes

Can't figure out why list keeps dropping everything else

5 Replies

JavaBot•15mo ago

⌛ This post has been reserved for your question.

Hey @Mike B! Please use /close or the Close Post button above when your problem is solved. Please remember to follow the help guidelines. This post will be automatically closed after 300 minutes of inactivity.

TIP: Narrow down your issue to simple and precise questions to maximize the chance that others will reply in here.

Mike BOP•15mo ago

else if (index == 0) {
            head = adding;

            Node<E> prevHead = getNode(index);
            adding.next = prevHead;
            
            tail.next = head;
        }

else if (index == 0) {
            head = adding;

            Node<E> prevHead = getNode(index);
            adding.next = prevHead;
            
            tail.next = head;
        }

the list works before this but when i try to add 8 to index 0

public void add(int index, E item){
        Node<E> adding = new Node<>(item);

        //If index out of bounds
        if (index < 0){
            throw new IndexOutOfBoundsException("Index out of bounds");
        }

        //If List = isEmpty
        else if(size == 0){
            //head = new node
            head = adding;

            //tail is also equal; to head because we have 1 item
            tail = adding;

            //tail points to the head
            tail.next = head;

        //Adding to the beginning of the list
            //If index = list size

        } else if(index == size){
            Node<E> prevNode = getNode(index-1);
            prevNode.next = adding;
            adding.next = prevNode.next.next;
            prevNode.next.next = tail;

        }

            //Adding anywhere else in list
        else {
            Node<E> before = getNode(index - 1);
            adding.next = before.next;
            before.next = adding;
        }

        size++;


    }

public void add(int index, E item){
        Node<E> adding = new Node<>(item);

        //If index out of bounds
        if (index < 0){
            throw new IndexOutOfBoundsException("Index out of bounds");
        }

        //If List = isEmpty
        else if(size == 0){
            //head = new node
            head = adding;

            //tail is also equal; to head because we have 1 item
            tail = adding;

            //tail points to the head
            tail.next = head;

        //Adding to the beginning of the list
            //If index = list size

        } else if(index == size){
            Node<E> prevNode = getNode(index-1);
            prevNode.next = adding;
            adding.next = prevNode.next.next;
            prevNode.next.next = tail;

        }

            //Adding anywhere else in list
        else {
            Node<E> before = getNode(index - 1);
            adding.next = before.next;
            before.next = adding;
        }

        size++;


    }

without the else if (index ==0), when I try to add a new number as the new head the code puts the number in index 1 and this is a circular linked list Anyone?

JavaBot•15mo ago

💤 Post marked as dormant

This post has been inactive for over 300 minutes, thus, it has been archived. If your question was not answered yet, feel free to re-open this post or create a new one. In case your post is not getting any attention, you can try to use /help ping. Warning: abusing this will result in moderative actions taken against you.

Unknown User•15mo ago

Message Not Public

JavaBot•15mo ago

💤 Post marked as dormant

This post has been inactive for over 300 minutes, thus, it has been archived. If your question was not answered yet, feel free to re-open this post or create a new one. In case your post is not getting any attention, you can try to use /help ping. Warning: abusing this will result in moderative actions taken against you.

Gaming

Programming

Linked List Nodes

Did you find this page helpful?