A data structure is said to be linear if its elements form a sequence or a linear list.

Examples:

• Array
• Linked List
• Stacks
• Queues

• Traversal : Visit every part of 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 : Rearranging the elements in some type of order(e.g Increasing or Decreasing)
• Merging : Combining two similar data structures into one