Update data_structures.md

Author: djeada

notes/data_structures.md

@@ -5,13 +5,13 @@ In computer science, a _collection_ (often interchangeably referred to as a _con
 1. At **The Abstract Level**, we focus on the conceptual understanding of collections, defining what they are and their characteristics. This includes how they store and retrieve items, whether it's based on a specific order (as in arrays or lists) or using unique keys (as in dictionaries or maps).
 2. **The Machine Level** refers to the practical implementation of collections, where we concentrate on efficiently realizing the abstract models. Factors like memory usage, operation speeds (insertion, deletion, search), and flexibility help determine the best data structures and algorithms for a specific task.
 
-Every programmer benefits from thoroughly understanding and studying collections. This knowledge empowers you to choose the most appropriate collection type for a given task, leading to programs that are not only more efficient in terms of time and space complexities, but also much more maintainable and robust due to clear structure and organization.
+Every programmer should really get to know collections well. It helps you pick the right type of collection for the job, making your code faster, more efficient, and easier to manage in the long run.
 
 ![G70oT](https://user-images.githubusercontent.com/37275728/185710905-8acd7541-e8ed-4439-a644-5d739b39e783.png)
 
 ### Linked Lists
 
-A _Linked List_ is a fundamental data structure in computer science, which comprises a sequence of elements, known as nodes. Each node in this sequence contains two distinct parts: 
+A _Linked List_ is a basic way to organize data where you have a chain of nodes. Each node contains two distinct parts: 
 
 1. A value (or data), which could range from simple data types to more complex structures.
 2. A reference (commonly referred to as a link or a pointer) to the subsequent node in the sequence.