Fill in the blanks in each of the following statements:

a) A(n) ___________class is used to define nodes that form dynamic data structures, which can grow and shrink at execution time.

b) Operator ___________allocates memory dynamically; this operator returns a reference to the allocated memory.

c) A(n) ___________is a constrained version of a linked list in which nodes can be inserted and deleted only from the start of the list; this data structure returns node values in lastin, first-out order.

d) A queue is a(n) ___________data structure, because the first nodes inserted are the first nodes removed.

e) A(n) ___________is a constrained version of a linked list in which nodes can be inserted only at the end of the list and deleted only from the start of the list.

f) A(n) ___________is a nonlinear, two-dimensional data structure that contains nodes with two or more links.

g) The nodes of a(n) ___________tree contain two link members.

h) The tree-traversal algorithm that processes the node then processes all the nodes to its left followed by all the nodes to its right is called ___________.