Question

If I had two data structures linked together (e.g. each node of a linked list contained an AVL tree) then when searching for one data item would the Big O efficiency be

• O(N) + O(logN) = O(N), using the most inefficient operation (the linked lists search)
  or
• O(N) * O(logN) = O(NlogN)?

Thanks in advance

Answer 1

let me understand what you are trying to ask.

you are saying that in linked list having each node,if that each node has a structure of avl tree, then what is the time complexity.

it is obviously O(nlogn)……..