Question: suppose you have ql as integer queue with the following data (1,2,3,4,5,6], where lis at the front of the queue and ql is passed to
suppose you have ql as integer queue with the following data (1,2,3,4,5,6], where lis at the front of the queue and ql is passed to a recursive method f1 (), what the output of executing f1()? void fl( Lqueue q1 ) { System.out.print (q1.dequeue(); if (!ql.isEmpty()) fi( q1); ) Select one: a. 1,2,3,4,5,6 O b. 6,5,4,3,2,1 c. method fl() is not executable Od. 1,6,2,5,3,4 The time complexity of the remove Back) operation of the double ended queue implemented
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
