Question

a.

b.

c.

If the client requests the removal of a single node in a general tree (a tree with no limit on the number of children per node) as we have studied it, this might result in many more nodes than the one requested to be removed (from the client's perspective) While the answer will be the same for normal and lazy deletion, you can assume this tree does normal, not lazy, deletion, to avoid unnecessary thinking time. O True False This is a sum-the-data-in-the-tree question. It asks whether a method, sumAll0 is a well-written recursive method. You will see three different versions of this question throughout the exam, but the opening assumptions, are identical for all such versions. The only difference between the various questions is the code that implements the method sumAll). Assumptions: The general tree in this problem is assumed to be physical, i.e., there is no lazy or soft deletion designed into this tree. While this is from a generic class with data type E, we assume that the client establishes E as Integer when instantiating the tree, so that the data can be added. We are considering a recursive work-horse method to sum all the (assumed) integer data of the sub-tree. The sub-tree is specified by the root pointer passed in. As usual, some client would pass a root to this method, then this recursive method would generate other (child or sibling) roots to pass to itself when recursing. The members sib and firstChild have the same meanings as in our modules. True of False: The method, as defined below, is a good recursive method for summing the data of the sub-tree, based at the root node passed in. To be true, it must satisfy all the following criteria. If it misses one, it is false: 1. It gives the right sum for the sub-tree, that is, it does not miss counting any data 2. it does no unnecessary work, micro-management or superfluous testing. 3. It covers all situations (empty trees, null roots, handles all the children, etc.). int sumAll(FHgTreeNode root) int sibSum, thisSum, childrenSum; if (root null) return ; = sumAllCroot.sib); childrenSum = sumAll(root. firstChild); this Sum (Integer)(root.data); sibSum sibSum thisSum; return childrenSum True O False java.util Linked Lists have which of the following properties? (Check all that apply.) Their add) method requires us to pass a wrapper object, like Float, rather than a primitive, like float to them. They are supplied to us as a generic class, meaning we can declare, in one statement, a Linked List of user-defined class data just as easily as if we were to define a LinkedList of Float type. They do not require that any ordering relation (like an compareTo()) be defined for the underlying data type. They can be directly declared by passing a primitive data type, like float, to the type parameter, without using a wrapper class, Float. They have an associated generic class Listlterator, which can be used to iterate through Linked Lists.

Answer 1

a. True

b. False

Explanation:

The order in which thr recursive calls are being made is incorrect.

c.

• They are supplied as a generic class, meaning we can declare in one statement, a LinkedList of user-defined class data just as easily as if we were to define a LinkedList of Float type.
• They do not require any ordering relation be defined for the underlying data type
• They have an associated generic class ListIterator, which can be used to iterate through LinkedLists.