Without using method size(), write recursive method stackSize(Stack > s1 ) that receives a stack and...

Without using method size(), write recursive method stackSize(Stack > s1 ) that receives a stack and returns number of elements in the stack. The elements in the stack should not be changed after calling this method. please do it in java

Expert Solution

Java Program:

import java.util.*; 
  
public class Main { 
    static int stackSize(Stack stack)
    {
        if(stack.isEmpty())
        {
            return 0;
        }
        stack.pop();
        return 1+stackSize(stack);
    }
    public static void main(String args[]) 
    { 
        // Creating an empty Stack 
        Stack<Integer> stack = new Stack<Integer>(); 
  
        // Use add() method to add elements into the Stack 
        stack.add(10); 
        stack.add(15); 
        stack.add(30); 
        stack.add(20); 
        int range=stackSize(stack);
        System.out.println("Size of Stack is:" +range);
    } 
}

Output:

Thank you Have a great day!!! Please do like...

venereology answered 8 months ago

Write a RECURSIVE method that receives as a parameter an integer named n. The method will...

Write a RECURSIVE method that receives as a parameter an integer named n. The method will output n # of lines of stars. For example, the first line will have one star, the second line will have two stars, and so on. The line number n will have "n" number of ****** (stars) so if n is 3 it would print * ** *** The method must not have any loops!

Write a RECURSIVE method that receives a string as a parameter. The method will return true...

Write a RECURSIVE method that receives a string as a parameter. The method will return true if the string received as a parameter is a palindrome and false if it is not. The method must not have any loops! In JAVA

Write a RECURSIVE method that receives 2 strings as parameters. The method will return true if...

Write a RECURSIVE method that receives 2 strings as parameters. The method will return true if the 2nd string is a subsequence of the 1st string. If not, the method will return false. An empty string is a subsequence of every string. This is because all zero characters of the empty string will appear in the same relative order in any string This method must not contain any loops. In java

Write method reverseStack(Stack s) that receives a stack s and reverse the order of its elements....

Write method reverseStack(Stack s) that receives a stack s and reverse the order of its elements. the values inside the stack must be changed, that the top will be the last and so on. please use java code to slove. Thank you.

Without using extra data structures, write a recursive method recursiveProdcutQueue ( Queue <Integer> q) in Test...

Without using extra data structures, write a recursive method recursiveProdcutQueue ( Queue <Integer> q) in Test class (in stacks_queues package) that receives a queue of integers and return the product of the integers inside the queue. Then don’t forget to test the method in the main. Make sure not to change values in queue after calling the method use java eclipse please

Data Structures ( Recursion ) Assignment Write a recursive method removeMiddle that receives an array list...

Data Structures ( Recursion ) Assignment Write a recursive method removeMiddle that receives an array list which has odd number of elements, then it deletes the element in the middle only. The method should receive only one parameter (the array list) The base case is when the array list has only one element, just remove that, otherwise, you need to remove the first one and the last one then call the method, then you need to add them again after...

Without using extra structures, write a recursive method recursivenumberOfNonZeros (Queue<Integer> q)in Test class (in stacks_queues package)...

Without using extra structures, write a recursive method recursivenumberOfNonZeros (Queue<Integer> q)in Test class (in stacks_queues package) that receives a queue contains integer objects and return total number of non zeros in this queue. Then don’t forget to test the method in the main. Note: Make sure not to change the order of the other values in queue after calling the method.

Code in c# Write a recursive method called isReverse(String s1, String s2) that accepts two strings...

Code in c# Write a recursive method called isReverse(String s1, String s2) that accepts two strings as parameters and returns true if the two strings contain the same sequence of characters as each other but in the opposite order and false otherwise. • The recursive function should ignore capitalization. (For example, the call of isReverse("hello", "eLLoH") would return true.) • The empty string, as well as any one letter string, should be its own reverse. Write a driver program that...

Write a Python function that receives a stack object s, where the items in the stack...

Write a Python function that receives a stack object s, where the items in the stack are only numbers in the set {0,1} and returns the number of 1's in the stack s. The function must satisfy the following restrictions: the state of the stack must be preserved; ie., after calling this function the state of the stack s must be the same it was before the function was called. The function cannot use any additional variables of any of...

/** * Write a recursive function that accepts a stack of integers and * replaces each...

/** * Write a recursive function that accepts a stack of integers and * replaces each int with two copies of that integer. For example, * calling repeatStack and passing in a stack of { 1, 2, 3} would change * the stack to hold { 1, 1, 2, 2, 3, 3}. Do not use any loops. Do not use * any data structures other than the stack passed in as a parameter. * @param stack */ public static void...

Question