Question

please use java

Question 1- 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. Note: Make sure not to change values in queue after calling the method. Example: If we have a Queue q of integer values as follows: 1 2 9 4 1 First , then when you call the method, it will return 72.

Answer 1

`Hey,

Note: If you have any queries related to the answer please do comment. I would be very happy to resolve all your queries.

import java.util.LinkedList;
import java.util.Queue;
public class Test{
public static int recursiveProductQueue(Queue<Integer> q)
{
if(q.size()==0)
{
return 1;
}
int num=q.poll();
return num*recursiveProductQueue(q);
}

public static void main(String []args){
Queue<Integer> q
= new LinkedList<>();
  
for (int i = 1; i <=5; i++)
q.add(i);
System.out.println(recursiveProductQueue(q));
}
}

I.lt Result $javac Test.java Sjava -Xmx128M -Xms16M Tes 120 Execute > Share Source File STDIN 1 import java.util.LinkedList; 2 import java.util.Queue; 3 - public class Test{ 4 public static int recursive ProductQueue (Queue<Integer> q) 5. { 6 if(q.size()) { 8 return 1; 9 } 10 int num=q.poll(); 11 return num recursive ProductQueue(q); 12 } 13. public static void main(String [] args) { 14 Queue<Integer> q 15 = new LinkedList<>(); 16 17 for (int i = 1; i <=5; i++) 18 q.add(i); 19 System.out.println(recursive ProductQueue(q)); 20 } 21 }|

Kindly revert for any queries

Thanks.