Blog

Fill in the blanks from the list of terms below.  (Use each term only once):                                        is where a derived class has two or more base classes.  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

Assuming ptr is a pointer variable, what will the following statement output?        cout

The __________ of recursion is the number of times a recursive function calls itself.

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

The programmer must ensure that a recursive function does not become

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

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

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

When an application begins by searching a binary tree, it starts at

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.