That they are finite, so that there will be exactly one object with only a However, for our examples, we will assume Infinite linear data structure is used in the Turing Machine example. In fact, in theoretical computer science, an Linear data structures do not have to be finite. Predecessor is the object which point to it. The arrow of each object points to its successor, and its If one thinks of it as a linked list, then one has Predecessor of the i th object is the (i-1 ) st object, and its One can implement it with either an array or a linked Have a successor and no predecessor (the first one). Without a successor (the last one) and there is at most one object can only At most one object only has a predecessor Objects in which each object has a unique predecessor and successor.
A linear data structure is a collection of
