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

O(hash) - complexity of the hash function

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

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

When deleting a node from a Binary Search Tree (BST), the worst case of this operation occurs when we try to remove the root node of the tree.

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

Assume we have the following list: [10, 9, 3, 4, 2, 5] and we select 3 to be the pivot. What would the list be after one iteration of quicksort? 

You should use the partition algorithm discussed in the pre-reading.

You have decided to use Quicksort to sort a list. What benefits will you have over MergeSort?

Is Mergesort a stable sorting algorithm?

You have decided to use Mergesort to sort a list. What benefits will you have over Quicksort?