A Data Structure is said to be linear if its elements forms a sequence or linear list.
Examples:
Examples:
- Arrays
- Stacks
- Link Lists
- Queues
- Traversal: To visit each and every element of Data Structure.
- Search: Traverse through data structure for a given element.
- Insertion: Adding a new element.
- Deletion: Removing an element.
- Sorting: To arrange the elements of data structure in a specific order(Asc/Desc ...).
- Merging: Combining two similar data structure into one.
No comments:
Post a Comment