Blog

Suppose the following values are inserted into a binary tree, in the order given: 12, 7, 9, 10, 22, 24, 30, 18, 3, 14, 20 Draw a diagram of the resulting binary tree. (Note: 12 is inserted first, then 7 and so on..) Draw the rest of the tree & fill in each box with values. If any pointers pointing to null, make sure to indicate them.

Fill in the blanks from the list of terms below.  (Use each term only once. Some terms are repeated more than once): A(n)                                    member function cannot access any nonstatic member variables in its own class.    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

Functions that are dynamically bound by the compiler are __________ functions.

A linked list is a series of connected

Which is the base class in the following statement?     class Car : public Vehicle

A new node must always be made the last node in a linked-list.

Fill in the blanks from the list of terms below.  (Use each term only once): The default access specification of class members is                                         .   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

All node pointers that do not point to other nodes are set to

Fill in the blanks from the list of terms below.  (Use each term only once): When defining objects of class templates, the                                     you wish to pass into the type parameter must be specified.    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

If an exception is not caught, it is stored for later use.