Job three (fourth week)

This week, our specialized course "data structure" classroom teacher gave us a chapter in the Curriculum "linear table". The teacher introduced: the definition of linear table, the abstract data type of linear table, the sequential storage structure of linear table (which includes the basic operation of sequential storage definition and sequential storage), the chain storage structure of linear table (chain storage definition, single linked list and its basic operation, Static, Loop and doubly linked list) There are also the advantages and disadvantages of the sequential table and linked list, and finally the application of linear table.

I know from last week's study. Linear structures are the most commonly used data structures, and linear tables are a typical linear structure. It is stored in two different ways. One is sequential storage, also known as physical storage. The second is the chain-store structure. Sequential storage can be represented by a one-dimensional array. The data table below 0 is the first digit of the data element. Chain storage structure is divided into single-linked list, circular linked list and double linked list. Now only on the single linked list. None of the last two have yet. A single-linked list refers to the location of a data element where each node consists only of a domain and a pointer field that is used to store data elements.

Job three (fourth week)