计算机知识2:DataStructure 数据结构
为什么需要数据结构 Why We Need Data Structures
想象一下，你有一个大箱子，里面装了一千件不同的东西。
Imagine you have a big box containing one thousand different things.
If you throw them in randomly, finding anything will be extremely difficult.
You need to search through the entire box, wasting time and energy.
但是，如果你用不同的盒子分类存放，情况就完全不同了。
However, if you use different boxes to store them by category, the situation is completely different.
把书放在书架上，把衣服放在衣柜里，把工具放在工具箱里。
Put books on the bookshelf, clothes in the wardrobe, tools in the toolbox.
This way, finding things is much faster.
Data structures are the “organization systems” in computers.
计算机要处理大量的数据，如果没有好的组织方式，效率会非常低。
Computers need to process massive amounts of data—without good organization methods, efficiency would be extremely low.
Why are data structures so important?
Because different data structures are suitable for different tasks.
就像你不能把水装进漏勺里一样，某些数据结构不适合某些用途。
Just like you cannot hold water in a colander, some data structures are not suitable for certain purposes.
选择正确的数据结构可以让程序运行得更快，占用更少的内存。
Choosing the correct data structure can make programs run faster and use less memory.
在大型系统中，数据结构的 choice 甚至可以决定系统的成败。
In large systems, the choice of data structures can even determine the success or failure of the system.
数据结构是什么 What Is a Data Structure
数据结构是一种组织和存储数据的方式，使得数据能够被高效地访问和修改。
A data structure is a way of organizing and storing data so that it can be accessed and modified efficiently.
This definition contains two key points.
The first is “organizing and storing”.
Data structures determine how data is arranged in memory.
就像图书馆的书籍排列方式决定了你能否快速找到想要的书。
Just like how books are arranged in a library determines whether you can quickly find the book you want.
The second is “accessing and modifying efficiently”.
Good data structures make common operations fast.
这些操作包括查找数据、添加数据、删除数据、更新数据等。
These operations include finding data, adding data, deleting data, updating data, etc.
Data structures can be divided into two major categories.
The first category is linear data structures.
In this type of structure, data elements are arranged in sequence, one after another.
Arrays, linked lists, stacks, and queues all belong to this category.
The second category is nonlinear data structures.
In this type of structure, data elements have more complex relationships.
Trees and graphs are typical nonlinear data structures.
常见数据结构介绍 Introduction to Common Data Structures
An array is the simplest data structure.
It’s like a row of consecutive lockers, each with a number.
You can directly access the contents of any locker by its number.
The advantage of arrays is fast access speed.
The disadvantage is fixed size—it cannot expand dynamically.
链表像一条链条，每个环节包含数据和指向下一个环节的链接。
A linked list is like a chain, where each link contains data and a link pointing to the next link.
To find an element, you must start from the beginning and search one by one.
The advantage of linked lists is dynamic growth.
The disadvantage is slow access speed.
A stack is like a pile of plates—you can only take or add plates from the top.
This is called the “Last In First Out” (LIFO) principle.
The last thing put in is the first thing taken out.
Stacks are used for scenarios requiring “undo” operations.
A queue is like lining up to buy tickets—the person who comes first buys tickets first.
This is called the “First In First Out” (FIFO) principle.
The element that enters the queue first is processed first.
Queues are used for task scheduling and message passing.
A tree is like a family tree, with root nodes and child nodes.
Each node can have multiple child nodes but only one parent node.
Trees are used to represent hierarchical data.
File systems are tree structures.
A graph is the most general data structure.
It consists of nodes and edges connecting the nodes.
A social network is a graph—people are nodes, friendships are edges.
Graphs can represent various complex relationships.
如何选择数据结构 How to Choose Data Structures
Choosing a data structure requires considering the following factors.
第一：操作类型 Type of Operations
What operations do you mainly perform?
If you need frequent lookups, arrays or hash tables may be better.
If you need frequent insertions and deletions, linked lists may be more suitable.
For small data volumes, simple structures are enough.
For large data volumes, more efficient complex structures are needed.
第三：内存限制 Memory Constraints
Some structures save space but are slow.
Some structures are fast but use more memory.
You need to balance based on actual circumstances.
第四：数据关系 Data Relationships
What relationships exist between the data?
If it’s a hierarchical relationship, use a tree.
If it’s a network relationship, use a graph.
If it’s a simple sequence, use an array or linked list.
数据结构实战示例 Data Structure Practical Examples
Let’s look at a practical example.
Suppose you need to design a browser’s forward and backward navigation feature.
What data structure should you use?
The answer is two stacks.
One stack stores backward history, one stack stores forward history.
When you visit a new page, push it onto the backward stack.
当你点击后退时，从后退栈弹出当前页面，压入前进栈。
When you click back, pop the current page from the backward stack and push it onto the forward stack.
When you click forward, pop the page from the forward stack and push it onto the backward stack.
This is a typical application of stacks.
Suppose you need to implement a task scheduling system.
Tasks execute by priority—higher priority executes first.
What data structure should you use?
The answer is a priority queue (heap).
A heap can quickly find the element with the highest priority.
Each time, take out the highest priority task to execute.
学习数据结构的建议 Suggestions for Learning Data Structures
Learning data structures requires a step-by-step approach.
First master the basic concepts and understand the characteristics of each structure.
Then learn basic operations and be able to implement them in code.
Most importantly, do more exercises and apply them in practical problems.
For each data structure you learn, ask yourself three questions.
What scenarios is it suitable for?
What are its advantages and disadvantages?
How to use it to solve practical problems?
Through such thinking, you will gradually master the essence of data structures.
Remember, data structures are the foundation of programming.
Master data structures well, and your programming skills will make a qualitative leap.
