×
They know who you are. Show them what you can be.
--Your friends at LectureNotes
Close

Data Structure using C

by Abhishek KumarAbhishek Kumar
Type: NoteInstitute: KIIT University Course: B.Tech Specialization: Computer Science EngineeringViews: 25Uploaded: 9 months ago

Share it with your friends

Suggested Materials

Leave your Comments

Contributors

Abhishek Kumar
Abhishek Kumar
Data Structures and Algorithms (CS-2001) KALINGA INSTITUTE OF INDUSTRIAL TECHNOLOGY School of Computer Engineering Strictly for internal circulation (within KIIT) and reference only. Not for outside circulation without permission 4 Credit Lecture Note
Chapter Contents 2 Sr # Major and Detailed Coverage Area Hrs 3 Linked List Singly Linked Lists and Chains, Representing Chains in C, Polynomials, Sparse Matrix, Doubly Linked Lists, Circular & Header Linked Lists 8 School of Computer Engineering
Linked List 3 Linked List is the linear data structure which are connected together via links and is a sequence of nodes which contains items and connection to another node. It is the second most used data structure after array. Important Concepts: Node − Each node of a linked list store a data called an element.  Next − Each Link of a linked list contain a link to next link called Next.  Head − A Linked List contains the connection link to the first node. This can also be termed as start.  Linked list can be visualized as a chain of nodes, where every node points to the next node. School of Computer Engineering
Linked List Example 4 School of Computer Engineering

Lecture Notes