C++ study guide need help

The average running time of insert operation for a BST with N nodes is: ... When sorting n records, Quicksort has average-case and best case cost of: ... If quadratic probing is used, and the table size is prime, then a new element can always be inserted if: ... A graph with n vertices and m edges is represented using an adjacency matrix. What is the lower bound for any algorithm that traverses all the edges of the graph? The const Object & front() const operation for list containers