0 数据结构（0 data structure）.doc

0 数据结构（0 data structure） The data structure Wikipedia, the free encyclopedia Jump to: navigation, search Binary trees are a type of data structure In computer science, data structure is the way in which data is stored and organized in a computer. In general, well-chosen data structures can lead to optimal efficiency (English: algorithmic efficiency). In general, the choice of data structures starts with the selection of abstract data types. A well-designed data structure should support the operation of various critical states in the context of the possible use of less time and space resources. Data structures can be implemented using the data types, references (English: reference (computer science)) and other operations provided by the programming language. Different types of data structures are suitable for different types of applications, and some are even dedicated to specific job tasks. For example, when a computer network depends on the routing table operation, B tree height applies to the encapsulation of the database. Choosing the appropriate data structure is a major consideration in many types of programming. The construction experience of many large systems shows that the difficulty of encapsulation and the quality and performance of the final results depend on whether the optimal data structure is selected. In many cases, it is easy to get the algorithm when you identify the data structure. In some cases, the direction is reversed: for example, when a key job requires an algorithm for a particular data structure, it will, in turn, determine the data structure it USES. In either case, however, the choice of data structures is critical. The key factor of system construction is the data structure, not the algorithm, which leads to the emergence of a variety of formal design methods and programming languages. Most language with some degree of modular thought, through the data structure of the concrete realization method of the encapsulated hidden behind a lim