What is the time complexity of common data structures?

What is the time complexity of common data structures like arrays and linked lists?

Arrays have O(1) for access, O(n) for search, and O(n) for insertion/deletion. Linked lists have O(n) for access, O(1) for insertion/deletion, and O(n) for search.

How does the time complexity differ for hash tables?

Hash tables offer O(1) average time complexity for search, insertion, and deletion, but can degrade to O(n) in worst-case scenarios.

What about trees, like binary search trees?

Binary search trees have O(log n) for search, insertion, and deletion on average, but can degrade to O(n) if unbalanced.

Can you explain the time complexity of graphs?

Graph time complexity depends on the representation. For adjacency lists, traversing is O(V + E), while for adjacency matrices, it's O(V^2).