An Array-Based Stack (contd.) • Pseudo-Code (contd.) Algorithm push(o): if size() = N then throw a StackFullException t ← t + 1 S[t] ← o Algorithm pop(): if isEmpty() then throw a StackEmptyException e←S[t] S[t]←null t←t-1 return e
590,000
625,000
6% off
1,499
2,499
40% off
590,000
625,000
6% off
3,999
5,499
27% off
999
1,499
33% off
590,000
0.0
5.0
Download the Study24x7 App, so you can connect and collaborate.
