What are the complexities of different data structures?

What are the time complexities of common data structures?

The time complexities vary: Arrays have O(1) for access, O(n) for search; Linked Lists have O(n) for access, O(1) for insertion.

How does the complexity differ between a stack and a queue?

Both stack and queue have O(1) time complexity for push and pop operations, but their usage patterns differ.

Can you explain the space complexity of a binary tree?

A binary tree has a space complexity of O(n) where n is the number of nodes, as each node requires space.

What about hash tables? What are their complexities?

Hash tables have average O(1) time complexity for insertions, deletions, and lookups, but can degrade to O(n) in worst cases.