# Read through all the provided source code to make sure that you

Instructions

1. Read through all  the provided source code to make sure that you understand the context. A  class named BinarySearchTree with an add method plus various utility  methods is provided for you. You must not change any  provided method with a body that is already complete. Note that linked  nodes are used to implement the BinarySearchTree class. Note also that  the data type allowed in the BinarySearchTree is constrained to be a  class that implements the Comparable interface and thus has a natural  total order defined.
2. The min method of the BinarySearchTree class currently has no body. You must provide a correct body for the min method.
3. A  sample main method is provided to illustrate building a simple binary  search tree and then using the min method to search for particular  values.

Problem Description: Finding the Minimum Value in a Binary Search Tree

Complete the body of the min method so that it returns the minimum value in the binary search tree.

The  following table lists an example call to min and the expected return  value when called in the context of the binary search tree pictured  below.

Method CallExpected Return Value

min() 1

/**

* Complete the min method in the nested BinarySearchTree class below.

*

*/

public class BSTMin {

/** Provides an example. */

public static void main(String[] args) {

BinarySearchTree<Integer> iBst = new BinarySearchTree<>();

Integer imin = iBst.min();

// The following statement should print 2.

System.out.println(imin);

BinarySearchTree<String> sBst = new BinarySearchTree<>();

String smin = sBst.min();

// The following statement should print A.

System.out.println(smin);

}

/** Defines a binary search tree. */

static class BinarySearchTree<T extends Comparable<T>> {

// the root of this binary search tree

private Node root;

// the number of nodes in this binary search tree

private int size;

/** Defines the node structure for this binary search tree. */

private class Node {

T element;

Node left;

Node right;

/** Constructs a node containing the given element. */

public Node(T elem) {

element = elem;

left = null;

right = null;

}

}

/*   >>>>>>>>>>>>>>>>>>  YOUR WORK STARTS HERE  <<<<<<<<<<<<<<<< */

///////////////////////////////////////////////////////////////////////////////

//    I M P L E M E N T  T H E  M I N  M E T H O D  B E L O W     //

///////////////////////////////////////////////////////////////////////////////

/**

* Returns the minimum value in the binary search tree.

*/

public T min() {

}

/*   >>>>>>>>>>>>>>>>>>  YOUR WORK ENDS HERE  <<<<<<<<<<<<<<<< */

////////////////////////////////////////////////////////////////////

// D O  N O T  M O D I F Y  B E L O W  T H I S  P O I N T  //

////////////////////////////////////////////////////////////////////

////////////////////

// M E T R I C S //

////////////////////

/**

* Returns the number of elements in this bst.

*/

public int size() {

return size;

}

/**

* Returns true if this bst is empty, false otherwise.

*/

public boolean isEmpty() {

return size == 0;

}

/**

* Returns the height of this bst.

*/

public int height() {

return height(root);

}

/**

* Returns the height of node n in this bst.

*/

private int height(Node n) {

if (n == null) {

return 0;

}

int leftHeight = height(n.left);

int rightHeight = height(n.right);

return 1 + Math.max(leftHeight, rightHeight);

}

////////////////////////////////////

// A D D I N G  E L E M E N T S //

////////////////////////////////////

/**

* Ensures this bst contains the specified element. Uses an iterative implementation.

*/

// special case if empty

if (root == null) {

root = new Node(element);

size++;

return;

}

// find where this element should be in the tree

Node n = root;

Node parent = null;

int cmp = 0;

while (n != null) {

parent = n;

cmp = element.compareTo(parent.element);

if (cmp == 0) {

return;

} else if (cmp < 0) {

n = n.left;

} else {

n = n.right;

}

}

// add element to the appropriate empty subtree of parent

if (cmp < 0) {

parent.left = new Node(element);

} else {

parent.right = new Node(element);

}

size++;

}

}

}

Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

## Calculate the price of your order

Total price:
\$0.00

How it works?

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

## Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.