A binary heap used as a priority queue supports extract-min in what time?

A binary heap is most commonly stored using which underlying structure?

In a max-heap, the value stored at every parent node is:

A priority queue always allows efficient retrieval of the element with the:

In a min-heap the smallest element is always located at the:

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

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