CS 261 - complexity questions

heap sort of bag implemented as dynamic arary?

o(n log n)

remove “single” of implemnted as dyamic array?

o(log n)

contains of bag implemented as dynamic array?

o(n)

contains of avl tree?

o (log n)ad

add of hash table with linked lists, when the table size if m =/= 0?

o(1)Inserting an element into a hash table with linked lists typically has an average time complexity of O(1), assuming a good hash function and low load factor. r

remove of “single” of hash table with linked lists, when the table size if m=/= 0?

o(n/m)

add of stack implemented as dynamic array?

o(1)Adding an element to a stack implemented as a dynamic array typically has an average time complexity of O(1), assuming no resizing is necessary.

remove of a queue implemented as double linked list?

o(1)

remove of queue implemented as deque, where deque is implmented as dynamic array?

o(1)

remove “single” of avl tree?

o(log n)

balance a node of avl tree?

o(1)

depth-first printing of nodes of avl tree

o(n)

avl sort of bag implmented as double linked list?

o(n log n)

convert bag to heap, where both bag and heap re implemented as dynamic array?

o(n log n)

remove “all” of avl tree?

o(log n)

remove operation of heap implemented as a dynamic array?

o(log n)

finding a data element in bag implemented as a dynamic array?

o(n)

add operation of hash table with chaining, when the table size is m?

o(1)ad

add operation of sorted bag implemented as a dynamic array?

(O(logn) + o(n) = o (n)