I want to construct a Max Heap from an unsorted list. What's the best-case time complexity? You can assume

For the sink operation on a Max Heap, is the best-case time complexity the same as the worst-case time complexity?

A Priority Queue could be implemented efficiently using an unbalanced Binary Search Tree?

I want to construct a Max Heap from a sorted list. What's the best-case time complexity? You can assume n is the number of elements in the list.

I want to implement a Priority Queue using the following Max Heap:

[None, 33, 27, 23, 7, 15, 18, 21, 6, 2, 3, 1, 8]

What should be the state of the heap after I serve an element from the queue?

I have decided to use a balanced Binary Search Tree (BST) to implement Separate Chaining in a Hash Table. What is the complexity of updating an item in such a hash table?

O(hash) - complexity of the hash function

I have decided to use a balanced Binary Search Tree (BST) to implement Separate Chaining in a Hash Table. What is the complexity of adding a new item in such a hash table?

O(hash) - complexity of the hash function

Provide the result of post-order traversal of the following Binary Search Tree (BST) as a sequence of nodes.

I want to generate a balanced BST from a list with numbers from 1 to 10 inclusive (in ascending order) and apply no self-balancing. To do that, what order should I insert items in?

What is the worst-case time complexity for deleting a node from a Binary Search Tree (BST)? You can assume there are n nodes in the BST.