Data Structure in Swift (Stack) — Part 3
Previously, we learned how to work with Linked List in Swift language. Today, we are going to implement Stack using Swift.
A stack is a data structure that allows us to arrange the items in a linear way. A stack basically follows the LIFO (Last In First Out) mechanism to insert or deletion of items. It means the last item added in Stack will be removed first.
In Stack, we can perform some operations like:
- push(): To insert an element.
- pop(): To remove the top-most element.
- peek(): To only get the top-most element.
A stack is used almost in all the programming languages. In iOS, some of the things are based on Stack like:
- UINavigationController uses the Stack to push and pop the controllers.
- Memory allocations for local variables are managed by Stack.
Now, move to the coding part in that we will learn how to implement Stack using Swift language.
Here, we will learn the Stack implementation using Array and without Array.
Stack with Array:
Example:
In the above code, we learned how to implement Stack with Array with the Generics. But we can use the Linked List concept to implement a Stack.
Stack without Array
Here, we will use the concept of Linked List.
In the Stack, both the operation push and pop are performed with time complexity O(1).
How we can see the use of Stack in the real world?
- In iOS, a UINavigationController uses the Stack for push and pop
- Undo/Redo functionality
- Go back and forward in Web Browsers
- Many more
I hope you enjoyed this article, so don’t forget to Clap it and follow me.
Get the full source code here: GitHub
Other Stuff
- See the previous stories of this series ‘Data Structure’:
- See the other stories on iOS (Swift):
Network Framework in iOS (Swift)
Spacing between each character in UILabel
Happy Coding !!
