KwickClips Python · 45 sec · free
Which list method pushes onto a stack?
Short answer. append().
How do you peek at the top?
With s[-1], the last item.
Remember
| push: append(), pop: pop() |
| peek: s[-1], empty: len == 0 |
A Python list is already a stack. Here is how. S is the stack. Append pushes. Minus one index peeks. Pop removes the top. Length zero is empty. Remember two things. Push is append, pop is pop. Peek is minus one, empty is length zero.
This clip is from the full lesson: Stack Implementation Using a List — 6 minutes, with the tables, the quick answers and the whole lesson in text.
Useful for: CBSE Class 12 Computer Science (083)
More KwickClips from this lesson
Disclaimer. KwickAcademy is free study material for general learning and revision. Parts of it, including the voice-over, are produced with the help of AI tools and may contain errors; if you spot one, please tell us and we will correct it. Syllabus, marks and exam details follow the latest official board publications available to us, and boards can change them at any time, so always confirm against your board's official website and your school. Using this material does not guarantee any marks or result. Board names and trademarks belong to their owners; Kwickprep is not affiliated with or endorsed by any examination board. We never ask for passwords, OTPs or ID numbers. Your progress is saved only in this browser. Full disclaimer · Privacy