Abstract
In a linear data structure, the elements are arranged in a specific order. Each element on a linear data structure is connected to the elements that proceed it as well as the element that follows it. In other words, the elements are placed in sequential order. Hence, it is possible to traverse the elements in sequential order in a single pass. The objective of the chapter is to provide a basic understanding of linear data structures and their implementation in Python. The chapter is organized as follows. The chapter starts with an introduction to the linear data structure. The objective is to provide a basic understanding of linear data structures. A comparison of linear data structures and non-linear data structures is given next. Next, all of the above-mentioned data structures are explained in brief. The Python implementation of all of these data structures is provided. After that, their applications and their implementation in Python is discussed. The chapter concludes by highlighting the essential concepts.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
