Linear Data StructuresA linear data structure is a structure where elements are arranged in a sequential order.Examples: Linked List, Array, Vector, Stack, Queue.1) Linked ListA structure where nodes containing data are connected via pointers, maximizing space efficiency.Insertion/Deletion: O(1)Search/Access: O(n) OperationTime ComplexityNotesLookupO(n)Must traverse from headAssignO(n)Same reaso..

Time ComplexityTime complexity describes how the number of operations grows as the input size N increases.It measures how much time an algorithm takes, independent of hardware or programming language.We focus on the number of operations, not exact timings.To express it, we use Big-O notation, which reflects the most significant term in the function T(n) — the one that dominates as n grows. Comm..