**This page is part of a series on my data structures project called Datos.** The full series is listed below. Enjoy.

Datos is spanish for Data. It's also the name of my project to implement some of the more common data structures. If you haven't looked at data structures since your uni days then this series is for you.

Let's face it. Most programming languages have abstracted away the need to understand the finer details of data structures. At least that's the case for your average programmer. We use an array here, a collection there, maybe an occasional dictionary and we've pretty much got most bases covered.

However it is important to understand the fundamentals of data structures so you are aware of their complexity. The complexity will help you decide which data structure to use. For example:

- how much memory is used (less important nowadays)
- speed to perform adding, removing and searching operations

Big O Notation is a huge help here. If you need a refresher be sure to read my previous blog post on the topic.

I'm going to keep it fairly simple and will be looking at the following data structures:

- Linked Lists
- Binary Search Tree
- Heap
- Sets
- Queues

That's it for now. You can view my Datos GitHub repository to see the work I've done so far on linked lists. I'll have a post covering these shortly.

Until then *Hasta luego!*