Fill in the blanks from the list of terms below.  (Use each…

Fill in the blanks from the list of terms below.  (Use each term only once): The first node in a binary tree is called the                                          .       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…

Fill in the blanks from the list of terms below.  (Use each term only once):                                        a node means adding it to the end of a list.     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