Skip to main content
Book Chapter

Linear Data Structures

  • Li L
Springer Berlin Heidelberg, (1998), 229-269
DOI: 10.1007/978-3-642-95851-9_7
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A data structure with homogeneous elements is linear if it organizes its elements into a sequence. In a computer, each data structure is finite in terms of the number of its elements. A linear data structure has a first and a last element. Each of the other elements in the linear data structure has a predecessor and a successor.

Cite

CITATION STYLE

APA

Li, L. (1998). Linear Data Structures. In Java: Data Structures and Programming (pp. 229–269). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-95851-9_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free