数据结构大纲（Data structure outline）.docVIP

数据结构大纲（Data structure outline） The introduction chapter does not appear in the outline of the scope of the investigation, but this chapter will help to grasp the understanding of the whole curriculum knowledge. Therefore, I suggest you still have to review this chapter. The test sites in this chapter and their mastery are as follows: Basic concepts of data structures Memorizing The logical structure of the data and the storage structure, which should be distinguished from the following nouns, which belong to the logical structure and which belong to the physical structure master The concept and measurement method of time and space complexity Understand Considerations in algorithm design understand The chapter of linear list is very important in the study of linear structure and even the whole data structure discipline. In this chapter, the concept of the first systematic introduction of chain stores, chain store concept will be the priority among priorities of the data structure of a subject, no matter which part are related to this concept, so it must engage in thorough. The basic concepts of linear table correlation, such as predecessor, successor, table length, empty table, first element node, head node, head pointer and so on Memorizing The structural features of linear list Memorizing Sequential storage of linear tables and two different implementations: static allocation and dynamic allocation of table spaces. Similarities and differences between static lists and sequential tables master Linear table chain storage method of realization, several commonly used list of characteristics and operations: single chain table, circular chain list, two-way chain list, two-way circular chain master Linear table of sequential storage and chain storage, the case of their different advantages and disadvantages, that is, their respective occasions Understand Set the head pointer in a single linked table, set the tail pointer in the circular list, and do not set the head point