MCPcopy Create free account
hub / github.com/Vishruth-S/CompetitiveCode / enque

Method enque

GeeksForGeeks/QueueUsingStacks/solution.cpp:17–20  ·  view source on GitHub ↗

oldest entered element is always at the top of stack 1

Source from the content-addressed store, hash-verified

15
16 // oldest entered element is always at the top of stack 1
17 void enque(int x)
18 {
19 s1.push(x);
20 }
21
22 // deQueue operation just pops from stack1
23 int dequeue()

Callers 1

mainFunction · 0.45

Calls

no outgoing calls

Tested by

no test coverage detected