data structure:
-----------basic knowledge------------------------------------- ---------
Data:
Data is a symbolic representation of objective things.
In computer science, data is the general term for symbols that can be entered into a computer and processed by a computer program.
Data-Element:
A data element is the basic unit of data.
A data element consists of several data items
In computers, programs usually treat data elements as a whole
Data-Item:
It is the smallest indivisible unit of data, and a data item is a data description of a certain characteristic of an objective thing.
DataObject (DataObject):
A collection of data elements that have a common property, which is a subset of data.
/*
For ease of understanding:
I understand it this way
Data is equivalent to a class of things in our lives, such as distance,
The data element is the unit of the data, that is, the unit of distance is m
The data item is an indivisible smallest unit, which is the smallest unit of distance units, and the smallest unit that appears now is nanometers
A data object is a collection of data elements with a common property. For example, in the distance, the length also represents the distance, and the width is also a small branch of the distance, but the length and width are generally used to represent the length and width of a rectangle.
*/
-----------basic knowledge------------------------------------- ---------
It consists of three parts:
Logical structure:
Logical relationships between data elements in a data structure
Physical structure:
The way the data elements in the data structure are stored in the computer and the logical structure is represented:
The storage of data structures in the computer is divided into the storage of data elements and the performance of the logical relationship between data elements
The logical structure of the data structure has two manifestations in the computer:
1. Sequential storage structure
2. Chain storage structure
Data manipulation:
Operations on data elements
1. Create a data structure
2. Clear a data structure
3. Delete an element in the data structure (delete)
4. Insert an element into the data structure (insert)
5. Access to the data structure (Access)
6. Sort the data structure (sort)
7. Search the data structure (Sertch)
8. Modify the data in the data structure (modify)
=======================================================
Logical structure:
Logical relationships between data elements in a data structure
Form definition:
Data-Structure={D,S}
D = finite set of data elements
S = relationship between data elements
Four basic types of logical structures"
1. Collection
The data elements in the data structure belong to the same set
2. Linear structure
There is a one-to-one relationship between the total data elements of the data structure
3. Tree structure
There is a one-to-many relationship between the data elements in the data structure
4. Graph structure
There is a many-to-many relationship between data elements in a data structure
===============================================================
Physical structure:
The way the data elements in the data structure are stored in the computer and the logical structure is represented:
The storage of data structures in the computer is divided into the storage of data elements and the performance of the logical relationship between data elements
The logical structure of the data structure has two manifestations in the computer:
1. Sequential storage structure
The relationship between elements is represented by the position of the data element in the memory, and the addresses of the data elements are required to be consecutive.
2. Chain storage structure
In each data element, a pointer that stores the address of another element is added, and this pointer is used to represent the logical relationship (logical structure) between the data elements.
==============================================================
Data manipulation:
Operations on data elements
1. Create a data structure
2. Clear a data structure
3. Delete an element in the data structure (delete)
4. Insert an element into the data structure (insert)
5. Access to the data structure (Access)
6. Sort the data structure (sort)
7. Search the data structure (Sertch)
8. Modify the data in the data structure (modify)