The stack type represents a last-in-first-out (LIFO) stack of generic items implemented using a linked list. It supports the usual Push and Pop operations, along with methods for Peeking at the top item, getting the size of the stack and testing if the stack is empty. The Push, Pop, Peek, Size, and IsEmpty operations all take constant time in the worst case.
-
Notifications
You must be signed in to change notification settings - Fork 0
inpour/stack
About
Stack (linked list implementation)
Resources
Stars
Watchers
Forks
Packages 0
No packages published