Consider a hash table with items, using separate chaining for collision resolution. There are some possibilities regarding the data structures that can be used to keep the separate chains. For each of the following data structures, you are interesting in knowing its worSorted Array

AVL Tree

Unsorted Linked$-$List

Binary$$Search$$Tree

for each of the above choose $0(1)$ or

O$($N$)$ or

O$($log$$N$)$