Data structure and algorithm--the definition and characteristics of linear table

1. Linear table Concept

A linear table is an ordered sequence of 0 or more data elements.

Icon:

2. Features

2.1 Order

As we can see , the elements in the linear table are lined up next to each other, just like the usual kids lining up for school.

2.2 Allow 0 elements, that is, empty tables

2.3 The first element is known and has only one successor, the last one has and only one precursor, and the other elements have only one precursor, and there is only one successor

We can see from the linear table inside the first element A1, he has no precursor, only one A2 successor, the last element an, only one precursor a (n-1), no corresponding successor, some other element ai, it has and only one precursor a (i-1) and has and only one successor a (i+1)

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Data structure and algorithm--the definition and characteristics of linear table