In a complete binary tree of n nodes, how far are the most distant two nodes? Assume each in the path counts 1. Assume log(n) is log base 2.

Which information is not saved in the activation record when a function call is executed?

The linked list implementation of sparse matrices is superior to the generalized dope vector method because it is __________.

Which situation occurs frequently if the selected hash function is poor?

The post-order traversal of a binary tree starts with:

In the dmaic process, the __________ step is to measure the existing process.

In the diagram of a binary tree, an arrow is called a(n) ____.

In oop, you declare a class that extends another class. this is called ________.

In a(n) ____________________ data type, each data item is a collection of other data items.

Every node (except of the last node) in a singly linked list contains ____.