Tree algorithms typically run in time O(d) . What is d?

Which of the following sorting algorithms yield approximately the same worst-case and average-case running time behavior in O(n*log(n))?

The operation for adding an entry to a stack is traditionally called ________.

For a complete binary tree with depth d, the total number of nodes is:

A variable or a value listed in a call to a method is called ________.

A two-dimensional array can be viewed as ___________ and _____________.

A three-dimensional array can be thought of as ________ of two-dimensional arrays.

Data can be organized and processed sequentially using an array, called a(n) ____ list.

Selection sort requires ________ passes to put n data items in order.