As we gain more knowledge in computer science, one of the most critical and essential topics to learn is the various forms of data structure. In layman’s terms, this is a study of how data are structured and used in various applications. Roughly speaking, there are about five to seven most commonly used data structure types. Each one satisfies a particular need, and there is no such thing as a perfect and do-it-all data structure. Therefore, we must understand all of them to know which ones to pick for our particular application needs. The first and most commonly used type of data structure is arrays. An array is a pre-determined allocation of spaces on the computer memory reserved for the sole purpose of storing a group of variables of the same data type. It is faster than declaring each variable independently, and it is suitable to use to store positioning data such as the longitudinal and latitudinal coordinates. Therefore, this data structure is ideal for use cases like navigation apps. Another most commonly used data structure type is queues. It is exactly as what it sounds, a queue, or in other words, a line. This type of data structure is ideal for use cases that involve orderly execution and infrastructure protections. For example, when data is traveling inside a queue, it is carried out in the order in which it was originally received, making it ideal for a game application that involves credential authentications. Last but not least, hash tables are another one of those instrumental data structures. It is typically seen and used in a database server environment because of its distinctive indexes and associative features.