. 2020 Mar 31;20(7):1965. doi: 10.3390/s20071965

Table 2.

Average and Worst Case search complexity, and memory requirements for n elements with m bit keys.

Data Structure	Avg. Search	WC. Search	Space
direct addressing	$O (1)$	$O (1)$	$2^{m}$
self-balancing binary search tree	$O (\log n)$	$O (\log n)$	n
hash table	$O (1)$	$O (n)$	n