Finite sequence of n data elements: linear form
Element name in lower case with the linear form, the linear form uppercase
The basic operation of the linear table:
- Linear table initialization
- Destruction linear table
- Empty linear table
- Determining whether a linear table is empty
- Seeking the length of the linear form
- One element taken linear table
- Retrieving linear elements in the table
- Back immediate predecessor element e of the linear elements in the table
- Returns element e elements immediately subsequent linear form
- Linear element is inserted before one table element
- To delete an element in linear form
- Linear traversing table
Linear table storage structure
Sequential storage
Link storage
Sequentially stores: a set of successive addresses of the storage unit sequentially stores the data elements in the linear form
Characteristics of the sequence table: linear logical structure table and storage structure (physical structure) consistent at any time to access a linear table is the same element, since the position of the element may be determined according to a mathematical formula.