Which data structure is best suited to model a first-come-first-served print queue?

Which data structure uses the First-In-First-Out (FIFO) principle?

A circular queue is preferred over a linear queue because it:

A deque (double-ended queue) allows insertion and deletion at:

A weighted graph is one in which:

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

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