be able to reduwile recursive neulous Some sample questions. 1. What advantage is a sorted array over an unsorted array (if any) regarding the fundamental operations? IS there any advantage an unsorted array has over a sorted array? 2. How do you search for a key step-by-step from a sorted array? 3. What is the meaning of big-Oh notation? 4. How to define the nodes in a single/double linked? 5. How do you change the references if you insert/delete a node in the middle of a single/ double linked list? 6. How do you change the references if you insert/remove a node at both ends of a double linked list? 7. How do you insert a node into a binary search tree? 8. When all references to a node are changed to refer to something else, what happens to the node? 9. What is the key value property of a binary search tree? 10. How do you find a key from a BST