What is the most appropriate complexity analysis (i.e. the closest fit) in terms of Big-O for the following operation? Converting a random vector into a binary heap, in place

A stack is the best data structure for implementing a breadth-first search.

What is the most appropriate complexity analysis (i.e. the closest fit) in terms of Big-O for the following operation? The delete function for a hash table

For a graph, the most efficient version of an unweighted shortest path algorithm would be

Given vector V:  45, 13, 30, 84, 22, 16, 55, 68, 40, 77, 91, 27, 5 If we use Shellsort, what is the state of V after the first pass, if the first increment value is 5?

In standard sequence containers like vector and linked list, a const_iterator is an iterator that cannot be changed.

Any sorting algorithm that sorts by exchanging adjacent elements requires

Suppose we have the following tree: Which of the following represents the printing of the tree’s nodes using an in-order traversal?

An algorithm takes 0.5 ms (milliseconds) for input size 1024.  Approximately how long (in milliseconds) will it take for input size 32,768 if the running time analysis for the algorithm is

The nurse is preparing to administer alteplase to the client.  Which of the following actions should the nurse initiate before administering the medication? Select all that apply.