Question

This implements a static void stack_push(Stack<Integer> stack) for(int i = 0; i < 5; i++) stack.push(i); LinkedList ArrayList Queue Stack

Answer 1

Stack

It will be the stack because whenever we use stack.push() function all the values will be placed according to stack condition like last in first out

For example;

import java.io.*;

import java.util.*;

class Test

{   

    

    static void stack_push(Stack<Integer> stack)

    {

        for(int i = 0; i < 5; i++)

        {

            stack.push(i);

       }

}

// Displaying element on the top of the stack

    static void stack_peek(Stack<Integer> stack)

    {

        Integer element = (Integer) stack.peek();

        System.out.println("Element on stack top : " + element);

    }

  

    public static void main (String[] args)

    {

        Stack<Integer> stack = new Stack<Integer>();

        stack_push(stack);

        stack_pop(stack);

        stack_push(stack);

        stack_peek(stack);

    }

}

Output:

4

3

2

1

0

Like stack