Suppose you have a deque D containing the numbers (2,3,4,5,6,7), in this order. Suppose further that you have an initially empty stack S. Give a code fragment that uses only D and S (and no other variables) and results in D storing the elements in the order (2,3,5,4,6,7
Answers
Answered by
1
Answer:
Explanation:lod c a
Similar questions