O(N) - ANSWER steps to delete item from BST, worst case
O(N) - ANSWER steps to build heap using bottom up method
O(lgN) - ANSWER steps to perform extactmin from min ordered heap
O(1) - ANSWER steps to perform enqueue on a queue implemented as a
linked list
O(N) - ANSWER steps for worst-case to insert an item into a hash table
O(1) - ANSWER goal of hashing is for inserts to take how many steps
O(N*lgN) - ANSWER heapsorting N elements takes how many steps?
O(1) - ANSWER using adjacency matrix, how many steps to determine if x
and y are adjacent
O(V) - ANSWER using adjacency matrix, how many steps to find all vertices
adjacent to x
O(V + E) - ANSWER how many steps to perform BFS of a graph
O(V) - ANSWER if we have a sparse graph with N vertices and the number of
incident edges of every node is <= 10, how long for DFS
O(1), O(lgN), O(N), O(N*lgN), O(N^2) - ANSWER what is ascending order
of runtimes
O(N) - ANSWER time complexity:
O(N) - ANSWER steps to build heap using bottom up method
O(lgN) - ANSWER steps to perform extactmin from min ordered heap
O(1) - ANSWER steps to perform enqueue on a queue implemented as a
linked list
O(N) - ANSWER steps for worst-case to insert an item into a hash table
O(1) - ANSWER goal of hashing is for inserts to take how many steps
O(N*lgN) - ANSWER heapsorting N elements takes how many steps?
O(1) - ANSWER using adjacency matrix, how many steps to determine if x
and y are adjacent
O(V) - ANSWER using adjacency matrix, how many steps to find all vertices
adjacent to x
O(V + E) - ANSWER how many steps to perform BFS of a graph
O(V) - ANSWER if we have a sparse graph with N vertices and the number of
incident edges of every node is <= 10, how long for DFS
O(1), O(lgN), O(N), O(N*lgN), O(N^2) - ANSWER what is ascending order
of runtimes
O(N) - ANSWER time complexity:
