Assume that you have three different data structures "binary search tree", "AVL tree", and

"hashing with separate chaining". In each data structure, there are $n$ integer numbers and want

to check if a specific number exists or not. In other words, you want to search a number in the

data structure. Select the worst case time complexity in the $0$ notation for the search operation

in each data structure.

Binary search tree

$[$ Choose $]$

AVL tree

Hashing $($Separate Chaining$)$

$[$ Choose $]$

$O(n^{{?}^{{?}^{?}}}2)$

$O(logn)$

$O(n^{**}logn)$

$O(n)$

$1$

None of these.