MCPcopy Create free account
hub / github.com/Ayush7614/Daily-Coding-DS-ALGO-Practice / front

Method front

Data Structures/QueueUsingLL.cpp:85–90  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

83 }
84
85 T front() {
86 // Return 0 if queue is empty
87 if(size==0)
88 return 0;
89 return fron->data;
90 }
91};
92
93

Callers 15

topoSortFunction · 0.80
topoSortFunction · 0.80
kahn_topological_sortFunction · 0.80
bfsFunction · 0.80
updateMatrixMethod · 0.80
levelOrderMethod · 0.80
cloneGraphMethod · 0.80
buildTreeFunction · 0.80
makeTreeMethod · 0.80
openLockMethod · 0.80
calculateMethod · 0.80
mainFunction · 0.80

Calls

no outgoing calls

Tested by

no test coverage detected