Deleting node from linklist and storing it in a stack in java

Question

1.00/5 (2 votes)

See more:

I am working on dataStructures and Algorithms.
I am currently working on linklist and stack.

In linklist i have created the delete method, which is going to remove the node from the linklist but i want to store the deleted node into a stack and then undo the store node in the stack back in the list and display it.
I need the assistance in order to solve the problem at hand.

What I have tried:

    public int delete(int index){
        if(index == 0){
            return deleteFirst();
        }
        if(index == size - 1){
            return deleteLast();
        }
        Node prev = get(index - 1);

        int val = prev.next.value;

        prev.next = prev.next.next;

//        mystack.push(val);

        return val;
    }

Posted 21-May-24 23:44pm

samcodeonline

Updated 21-May-24 23:46pm

v2

Add a Solution

Comments

Richard Deeming 22-May-24 5:52am

You haven't explained what assistance you need.

The only obvious issue that jumps out is that if the linked list is not sorted, storing the value you've removed won't be enough to restore it in the correct position; you'll also need to store the index you removed it from.

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Answer 1 · 2024-05-22T00:43:00

Solution 1

I wouldn't have called the mystack.push(val); inside the delete method of the list.
Instead I would have written (in the 'consumer' code) something like

Java

int val = mylist.delete(index);
mystack.push(val);

Posted 22-May-24 0:43am

CPallini

Comments

samcodeonline 22-May-24 8:20am

I want to store this deleted node in a stack and then displaying it again in the list i deleted it from. Could you provide me with the code, that i want to accomplish.

Dave Kreskowiak 22-May-24 10:15am

Nobody is going to write your code for you. The only code you get is the code YOU write.

samcodeonline 22-May-24 8:20am

custom linklist and stack implementation

Dave Kreskowiak · Answer 2 · 2024-05-22T04:18:00

Like Richard said, you cannot restore the node you pushed onto the stack because you're losing the position in the linked list where the node came from.

To make this work, you would have to create a class that can hold your node instance AND the data required to insert it back into the correct position in the linked list. When you delete a node from the list, you create an instance of this wrapper object, populate it with the node you're deleting and the position information, and push this wrapper object onto the stack.

Deleting node from linklist and storing it in a stack in java

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0

Existing Members

...or Join us