Basics of Hash Tables Hash tables are data structures that maps key/value pairs for highly efficient lookups. In a hash table, data is stored in an array format, where each data value has its own unique index (key), coupled with a value. Access of data becomes very fast if we...

Hey all! I believe I have two data structures left to talk about so this will be the second last of the series. Today I will be talking about arrays. The most basic of all data structures, an array stores data in memory for later use. Whenever you’d like to...

Onto the third installment of the DSA series! Today, I’ll be going over stacks, queues, and binary heaps. Stacks A stack uses last-in-first-out (LIFO). One useful case to use stacks is for recursive algorithms. Sometimes you need to push temporary data onto a stack as you recurse, but remove them...

Welcome back to the next of the DSA series! Basics of a Tree Trees are a data structure that is composed of nodes. The structure of a tree looks like so: Root node Root node has 0+ child nodes Each child has 0+ child nodes A node is called a...

Basics of a Linked List A linked list is a type of data structure that represents a sequence of nodes. The structure of a linked list consists of nodes, where each node is composed of data and a reference to the next node in the sequence. The first node is...