Can Dijkstra's be used to find the longest-path in a graph?

If a node having two children is deleted from a binary tree, it is replaced by its:

The path length from a node to the deepest leaf under it is the _________.

Worst case for a binary search tree is

What is the worst-case time complexity of finding a maximum cardinality matching in a bipartite graph G = (V,E)?

What is the worst-case time complexity of the simple Ford-Fulkerson algorithm for finding the maximum flow in a graph given a source and a sink, and all integer capacities on edges? Assume the graph G = (V,E) has a finite, integer maximum flow value of f.

The following pseudocode is an example of ____.

When an array is passed to a function, it is actually ________ the array that is passed.

Pseudocode uses the end-structure statement ____ to clearly show where the structure ends.

A(n) ________ member variable may be accessed before any objects of the class have been declared.

A bubble sort is sometimes called a ____.