Skip to content

Latest commit

 

History

History
48 lines (35 loc) · 1.7 KB

part02-linear-data-structures.asc

File metadata and controls

48 lines (35 loc) · 1.7 KB

Linear Data Structures

Data Structures come in many flavors. There’s no one to rule them all. You have to know the tradeoffs so you can choose the right one for the job.

In your day-to-day work, you might not need to re-implement basic data structures. However, knowing how they work internally can help you understand their time complexity better (Remember the chapter How to determine Big-O from code?).

When you are aware of the data structures implementations, you spot when to use one over the other or even extend them to create a new one. We are going to explore the most common data structures' time and space complexity.

In this part we are going to learn about the following linear data structures:

Later, in the next part, we are going to explore non-linear data structures like Graphs and Trees.

If you want to have a general overview of each one, take a look at the following interactive diagram: