recategorized by
467 views
2 votes
2 votes

# plz check ??? i missed something

recategorized by

1 Answer

1 votes
1 votes
You missed the function call f(Q) that is called recursively. And at last recursive call first insert will be done and so on, which eill reverse queue.

Related questions

1 votes
1 votes
1 answer
1
Kalpataru Bose asked Jan 19, 2018
443 views
Can someone explain the solution along with a picture of how the steps are taking place?
0 votes
0 votes
1 answer
2
manvi_agarwal asked Jul 29, 2018
313 views
https://gateoverflow.in/?qa=blob&qa_blobid=10936115150698131975
1 votes
1 votes
2 answers
4
CHïntän ÞäTël asked Dec 10, 2018
977 views
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!