For each of the following operations choose from the drop down menu the expected time complexity for the indicated data structure containing N scalar items. Your answers should assume $$favorable$$ operating conditions, for example the tree is balanced, hash table has low load factor, there is space in the array, etc. If you are faced with multiple ways to achieve the same goal choose the fastest approach appropriate for the data structure.

Search: located a given item within the data structure: