The process of moving through a linked list is referred to as __________ the list.

In a binary tree, each node may point to __________ other node(s).

Protected members of a base class are like __________, but they may be accessed by derived classes.

True/False More than one class may be derived from a base class. 

A(n) __________ is like a pointer. It is used to access the individual data elements in a container.

Fill in the blanks from the list of terms below.  (Use each term only once):                                  recursion is when function A calls function B, which in turn calls function A.      private static members last data type dequeuing subtree pointer structure return static scope resolution new head static indirect aggregation children before & friend strcpy Object-oriented first try Appending Multiple inheritance doubly-linked depth root node instantiation destructor enqueuing Memberwise assignment

Fill in the blanks from the list of terms below.  (Use each term only once): A binary tree node’s left and right pointers point to the node’s                                      .        private static members last data type dequeuing subtree pointer structure return static scope resolution new head static indirect aggregation children before & friend strcpy Object-oriented first try Appending Multiple inheritance doubly-linked depth root node instantiation destructor enqueuing Memberwise assignment

When function A calls function B which, in turn, calls function A, this is known as

Deleting a leaf node from a binary tree is not difficult but deleting a non-leaf node requires several steps.

Two primary queue operations are