Please enable JavaScript.
Coggle requires JavaScript to display documents.
Hash Tables, LinkedList, Stack and Queue - Coggle Diagram
Hash Tables
Pointers in Python
-
Variables in lower languages like C, C++ are mutable
-
-
-
Search, Lookup, Insert, Delete - O(1)
Traversal - O(n)
LinkedList
Uses of Pointers
Implemented LL using Mutable datatype Dictionaries in which we are able to change the values in place
-
-
-
-
-
Stack and Queue
How would you impl stacks using Arrays vs LL?
you can use both for stacks as both datastructures will provide similar functionality
Technically Both have O(1) for push and pop operations but Still arrays would be faster due to cache locality
-