Chapter 25.2, Problem 25.2.5CP

Explanation of Solution

Implementation of “search (element)” method using recursion:

//definition of Boolean search method

public boolean search (E e)

{

//return true if the element is in the tree

return search (root, e);

}

//definition of "search" method

public boolean search (TreeNode<E> root, E e)

{

//check the "root" is null or not

if (root == null)

//return statement

return false;

//check the "root" value is less than 0

else if (e.compareTo (root.element) < 0)

//return statement

return serach (root.left, e);

//check the "root" value is greater than 0

else if (e.compareTo (root.element) > 0)

//return statement

return serach (root...