Search for a command to run...
Series
In this series we will go through Data Structures implementations using Go programming language
Trees are non linear data structures in the world of computer science where each element is called a node and each node may or may not have children associated with them. Binary Trees are a special type of trees where each node can have up to two chi...
Heaps are one of the most famous example of non-linear data structures because of the various use-cases where heaps give advantage over other data structures in terms of time and space complexity. We will be using the example of max-heap where the m...
Linked Lists as data structures are very powerful and provide a lot of flexibility and enhanced performance especially in systems with memory constraints towards continuous memory allocation because linked lists do not need a large continuous block o...
First In, First Out
Last In, First Out
