Question

Using Java

You are given a Node class and a List class:

public class Node

{

   int   data;

    Node next;

}

public class List

{

    Node first;

}

You are also given a Stack class. The following functions are available for use:

public class Stack {

public boolean isEmpty(){};

public void push(int n){};

public int pop(){};}

Write a Java method snglyRevToStck that pushes the data found in a linked list t in reverse order into the stack s, such that the last data in the list will be pushed first into the stack s, and so on.

Hint: You may use a temporary stack to accomplish the task.

You are given a Node class and a List class: public class Node int data: Node next; public class List Node first; You are also given a Stack class. The following functions are available for use: public class Stack I public boolean isEmpty Opublic void push (int n) public int pop (O Write a Java method snglyRevToStck that pushes the data found in a linked list t in reverse order into the stack s, such that the last data in the list will be pushed first into the stacks, and so on. Hint: You may use a temporary stack to accomplish the task.

Answer 1

Code Screenshot

public Stack snglyRevToStck (List t) // point &EAỵ to first node f list t Node travtfirst / create a temporary stack Stack tempnew StackO /I sza through the list t while ( trav != null ) //push the current node data to temp temp push ( trav.data move to next node travtrav.next // create a new atsk s Stack s = new Stack(); /1 loop until temp stack is empty while tmisEmptyo // get the top most element of temp int x = temp . pop ( ) ; //push x into s s push x return s:

Code

public Stack snglyRevToStck(List t)

{

    // point trav to first node of list t

    Node trav = t.first;

   

    // create a temporary stack

    Stack temp = new Stack();

   

    // trav through the list t

    while( trav != null )

    {

        // push the current node data to temp

        temp.push( trav.data );

       

        // move to next node

        trav = trav.next;

    }

   

    // create a new stck s

    Stack s = new Stack();

   

    // loop until temp stack is empty

    while( !temp.isEmpty() )

    {

        // get the top most element of temp

        int x = temp.pop();

       

        // push x into s

        s.push( x );

    }

   

    return s;

}