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 worst$-$case time complexity to insert an item into$$the$$hash$$table$.$

Sorted Array

AVL Tree

Unsorted Linked$-$List

Binary Search Tree

for each of the above choose

O$(1)$ or O$($N$)$ or O$($log N$)$

But these are the answers i got.. are they wrong?

Sorted Array: O$($N$)$

AVL Tree: O$($log N$)$

Unsorted Linked$-$List: O$(1)$

Binary Search$$Tree:$$O$($N$)$