Stack implementation using List(Python)

Published: 01 January 1970
on channel: Engineering Mastery Made Simple

The functions associated with stack are:

empty() – Returns whether the stack is empty – Time Complexity: O(1)
size() – Returns the size of the stack – Time Complexity: O(1)
top() / peek() – Returns a reference to the topmost element of the stack – Time Complexity: O(1)
push(a) – Inserts the element ‘a’ at the top of the stack – Time Complexity: O(1)
pop() – Deletes the topmost element of the stack – Time Complexity: O(1)

On this page of the site you can watch the video online Stack implementation using List(Python) with a duration of hours minute second in good quality, which was uploaded by the user Engineering Mastery Made Simple 01 January 1970, share the link with friends and acquaintances, this video has already been watched 38 times on youtube and it was liked by 1 viewers. Enjoy your viewing!