MCPcopy Create free account
hub / github.com/Lakhankumawat/LearnCPP / pop

Method pop

S-Stack/StacksUsingQueue.cpp:39–46  ·  view source on GitHub ↗

pop easy

Source from the content-addressed store, hash-verified

37
38 //pop easy
39 void pop(){
40 if(q1.empty()){
41 cout << "Stack is empty!" << endl;
42 return ;
43 }
44 q1.pop();
45 N--;
46 }
47
48 int top(){
49 if(q1.empty()){

Callers 15

topoSortMethod · 0.45
TopologicalBfsMethod · 0.45
huffmancodeFunction · 0.45
min_computationFunction · 0.45
kLargestMethod · 0.45
costFunction · 0.45
bfsMethod · 0.45
primsMethod · 0.45
bipartiteFunction · 0.45
bfsFunction · 0.45
isPalindromeFunction · 0.45
bfsFunction · 0.45

Calls 1

emptyMethod · 0.80

Tested by

no test coverage detected