Time & Space Complexity For Each Of The Following

Binary Tree

ALgo	Best Case	Worst Case
Space	O(n)	O(n)
Access	O(log n )	O(n)
Search	O(log n)	O(n)
Insert	O(log n)	O(n)
Delete	O(log n)	O(n)

Hash-Table

ALgo	Best Case	Worst Case
Space	O(n)	O(n)
Access	N/A	N/A
Search	O(1)	O(n)
Insert	O(1)	O(n)
Delete	O(1)	O(n)

Linked-list

ALgo	Best Case	Worst Case
Space	O(n)	O(n)
Access	O(n)	O(n)
Search	O(n)	O(n)
Insert	O(1)	O(1)
Delete	O(1)	O(1)

Queue

ALgo	Best Case	Worst Case
Space	O(n)	O(n)
Access	O(n)	O(n)
Search	O(n)	O(n)
Insert	O(1)	O(1)
Delete	O(1)	O(1)

Stack

ALgo	Best Case	Worst Case
Space	O(n)	O(n)
Access	O(n)	O(n)
Search	O(n)	O(n)
Insert	O(1)	O(1)
Delete	O(1)	O(1)