Data Structure:

data structure is a specialized format for organizing and storing data. General data structure types include the array, the file, the record, the table, the tree, and so on.

In Data Structure two types:

  1. Linear:
  2. Non Linear

Linked list is an example of linear data storage or structure. Linked list stores data in an organized a linear fashion. They store data in the form of a list.

What is Link List?

In computer science, a linked list is a linear collection of data elements, called nodes, pointing to the next node by means of a pointer. It is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of data and a reference (in other words, a link) to the next node in the sequence. This structure allows for efficient insertion or removal of elements from any position in the sequence during iteration. More complex variants add additional links, allowing efficient insertion or removal from arbitrary element references.

A linked list is a linear data structure where each element is a separate object. Each element (we will call it a node) of a list is comprising of two items – thedata and a reference to the next node. The last node has a reference to null. The entry point into a linked list is called the head of the list.

Following are important terms to understand the concepts of Linked List.

  • Link − Each Link of a linked list can store a data called an element.
  • Next − Each Link of a linked list contain a link to next link called Next.
  • Linked List − A Linked List contains the connection link to the first Link called First.

Linked list can be visualized as a chain of nodes, where every node points to the next node.

Types of Linked List

Following are the various flavours of linked list.

  • Simple Linked List − Item Navigation is forward only.
  • Doubly Linked List − Items can be navigated forward and backward way.
  • Circular Linked List − Last item contains link of the first element as next and and first element has link to last element as prev.

Basic Operations

Following are the basic operations supported by a list.

  • Insertion− add an element at the beginning of the list.
  • Deletion− delete an element at the beginning of the list.
  • Display− displaying complete list.
  • Search− search an element using given key.
  • Delete− delete an element using given key.

If you like this post then please share and like this post.

Visit us @

Call us @ 98256 18292

To Learn More data structure course, computer course in Ahmedabad


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s