Stack

Queue

Linked Lists

Tree

• SINGLE LINKED LIST

• DOUBLE LINKED LIST

• DOUBLE LINKED LIST - INSERTION SORT

LINKED LISTS:

DEFINITION:

- A linked list is a chain of items which are called nodes. Each of the nodes in a single linked list have at least two parts, one of which points to the next item or node in the list. A double linked list contains an extra part which points to the previous item or node in the list. Double linked lists have two ends and two beginnings, where as a single linked list has only one of each. When using linked lists an item can be inserted to or deleted from anywhere in the list at anytime.

OPERATIONS:

• Inserting an item in the midddle of the list
• Inserting an item at the end of the list
• Inserting an item at the beginning of the list
• Deleting an item from the middle of the list
• Deleting an item from the end of the list
• Deleting an item from the beginning of the list