Data structures can be logically divided into two categories: linear structures and non-linear structures.
Logical structure is the logical relationship between data elements. It describes data from the logical relationship and has nothing to do with the storage of data. Logical structures are therefore divided into two broad categories based on the relationships between data elements: linear structures and nonlinear structures. The set structure and non-set structure, tree structure and graph structure all refer to specific data structure types.
Introduction to relevant knowledge points:
There are four basic types of logical structures: set structure, linear structure, tree structure and network structure.
Tables and trees are the two most commonly used efficient data structures. Many efficient algorithms can be designed and implemented using these two data structures. Tables are linear structures (total order relationships), trees (partial order or hierarchical relationships) and graphs (weak/local order) are non-linear structures.
The above is the detailed content of What two categories can data structures be logically divided into?. For more information, please follow other related articles on the PHP Chinese website!