Given the BinarySearchTree and Node Classes Discussed in Section 17

question 98

Multiple Choice

Given the BinarySearchTree and Node classes discussed in section 17.3 (partially shown below) , select an expression to complete the recursive method smallest in the Node class. The method returns the smallest data value in the binary search tree rooted at a node. public class BinarySearchTree
{
Private Node root;
Public BinarySearchTree() {...}
Public void add(Comparable obj) {...}
Public Comparable smallest()
{
If (root == null)
Throw new NoSuchElementException() ;
Else
Return root.smallest() ;
}
Class Node
{
Public Comparable data;
Public Node left;
Public Node right;
Public Comparable smallest()
{
If (left == null)
Return data;
Else
Return _______________;
}
}
}

• A) left.smallest()
• B) right.smallest()
• C) data.smallest()
• D) Math.min(left.smallest(), right.smallest())

---

Definitions:

Modigliani

Refers to Franco Modigliani, an Italian-American economist known for his work on corporate finance, the Modigliani-Miller theorem, and the life-cycle hypothesis of saving.

Developed

Pertains to countries that have a high level of industrialization, a high standard of living, and a well-established economic structure.

Evaluating Mutual Funds

The process of assessing the performance, management, and investment strategies of mutual funds to determine their suitability for an investor.

Rank Portfolios

The process of arranging portfolios in order according to a certain criterion, such as return or risk.