Question 1
In a ________, the element just inserted is always at the leaf.
◦ AVL tree
◦ binary search tree
◦ binary heap
Question 2
The average time-complexity for insertion, deletion, and search in a ________ is O(logn).
◦ AVL tree
◦ binary heap
◦ binary search tree