Skip to Main Content
Programming and Data Structures
book

Programming and Data Structures

by Ashok Kamthane
August 2009
Intermediate to advanced content levelIntermediate to advanced
604 pages
21h 39m
English
Pearson India
Content preview from Programming and Data Structures
528 Programming and Data Structures
SU MM AR Y
1) The list implemented using an array is called static list. A list is a series of linearly arranged
numbers of the same type. The list can be of basic data type or custom data type.
2) Static implementation can be done using arrays.
3) The simple list can be created using an array in which elements are stored in successive memory
locations.
4) In the list, we have n, (n -1) as predecessor and (n+1) as successor elements. In other words, for
any number in the list, there exist a left element to it as predecessor and the right element as
successor. The first element does not have a predecessor ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Learning Data Structures and Algorithms

Learning Data Structures and Algorithms

Rod Stephens
Data Structures and Algorithms in C++, Second Edition

Data Structures and Algorithms in C++, Second Edition

Michael T. Goodrich, Roberto Tamassia, David M. Mount

Publisher Resources

ISBN: 9789332506343