Unbalanced binary search trees lab question

This prelab is focused on making sure you have a good grasp of Binary Search Trees and the reasoning behind using the AVL balancing criteria to keep the tree balanced. Unbalanced Binary Search Trees: 1. What property of the tree does the upper bound for each of the main tree operations (Find, Insert, Delete) depend on? 2. What are the expected runtime (assuming random insertion order of unique elements) and worst-case runtime of inserting 1 element into a BST that already contains n elements? 3. What are the expected and worst-case runtimes of inserting n elements into an initially empty BST? 4. Give an insertion sequence of 8 elements that would lead to the best-case insertion time in an initially empty tree, then one that would lead to the worst-case insertion time. 5. In the worst-case insertion scenario, what other data structure that we've covered in this class does the BST become effectively equivalent to