A sparse matrix is best stored using a representation that:

Which traversal of a binary search tree visits nodes in ascending sorted order?

Which traversal visits the root node last, after both subtrees?

In a circular linked list, the last node's next pointer points to:

The postfix (Reverse Polish) expression 3 4 + 5 * evaluates to:

A weighted graph is one in which:

A hash table with a good hash function provides what average-case time complexity for insertion?