Getting started with data structures (2)

To make it easier for computers to serve us, we need to digitize all things in reality and store them in the computer, because there is a certain relationship between things in reality and things, so we need to study these relationships (forms of existence in the computer world and forms of existence in the real age ), that is to say, we need to study the logical structure in the data structure (several ways in which relations exist in the real world) and physical structure (several ways in which relations exist in the computer world ), both the logical and physical structures are on paper, and are actually used as data operations (algorithms ).

 

In which way do we divide the relationship between real things and things into several types (models )?

We use the relationship between several data elements (an abstraction of objective things) and several data elements as the basis for division. Based on this, we have divided four types of models (also known as linear and nonlinear, linear is one-to-one, and non-linear is several to several ):

(Set structure: no connection between a node and a node; linear structure: a node and a node connection; tree structure: one node and multiple nodes (generally multiple exist: Left and Right children, you can also have a [child] or no [Leaf] node connection, but the node's precursor can only have one; graphic structure: the node can have multiple precursor and multiple successors)

These four structures are an umbrella of the relationship between objective things and a structure that represents all objective things. These four structures are the structures that computers need to store. However, the real storage method inside the computer is different from this. From the computer perspective, we call these structures logical structures, and the storage structures inside the computer are called physical structures.

What methods does a computer store these logical structures?

Chain stores have single-chain tables and double-chain tables. The basic structure is similar to that of node pointers. Let's talk about the memory storage format, and insert a single-chain table chart below:

Index storage graph:

 

What operations do computers perform on data?

We have used many algorithms in data operations!

Data Structure Overview