Too Long; Didn't Read
We are trying to learn basic concepts about heaps like inserting and extracting data from heaps and also the time complexity of heaps. Heaps are a very interesting data structure, we think it is like a tree structure but actually, it is an array. The data structure was originally introduced as a part of the algorithm called heap sort but the data structure introduced there was also important for other applications such as priority queues, Selection algorithms, Graph Algorithms, etc. We will be developing a heap data structure from scratch using GoLang.