Erik P. Williams
I work to make a better web; one that is fast, easy to use, beautiful, accessible to all, and frustration-free. Regardless of your specific business requirements.
I work to make a better web; one that is fast, easy to use, beautiful, accessible to all, and frustration-free. Regardless of your specific business requirements.
Full stack developer and computer science student at California State University Fullerton studying Computer Science. Earned a Full Stack Web Development certificate from the University of California Los Angeles Coding Boot Camp in 2022. Graduating from Cal State Fullerton w/ BS in 2025
A hash table (also known as a hash map) is a powerful and versatile data structure that allows you to store and retrieve values based on a key. Under the hood, it uses an array combined with a hashing function to provide rapid key-based access to stored data.
A binary tree is a hierarchical data structure in which each node has at most two children, commonly referred to as the left child and the right child. The topmost node is called the root.
A stack is a linear data structure that follows the LIFO (Last In First Out) principle. This means that the last element added to the stack will be the first element to be removed. Think of a stack as a pile of books; you add (push) a new book on top and you remove (pop) the top book when needed.