C Linux Pro

A data structure is a way of storing data in the memory so that it can be used efficiently.

A data structure is said to be linear if its elements form a sequence.
Examples:
• Arrays
• Linked Lists
• Stacks, Queues

• Non linear data structures do not form a sequence.
• Non linear data structures are very flexiable and powerful datastructures and these can be used for wide variety of applications.
•Non linear data structures are most random in nature.
• programming on  non linear data structures is difficult.
Examples:
• Trees
• Graphs

• Traversal:
        Travel through the data structure.
• Search:
        Traversal through the data structure for a given element.
• Insertion:
        Adding new elements to the data structure.
• Deletion:
        Removing an element from the data structure.
• Sorting:
        Arranging the elements in some type of order.
• Merging:
        Combining two similar data structures into one.