Instructions
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.
public class BSTMin {
/** Provides an example. */
public static void main(String[] args) {
BinarySearchTree<Integer> iBst = new BinarySearchTree<>();
iBst.add(10);
iBst.add(12);
iBst.add(8);
iBst.add(2);
iBst.add(6);
iBst.add(4);
Integer imin = iBst.min();
// The following statement should print 2.
System.out.println(imin);
BinarySearchTree<String> sBst = new BinarySearchTree<>();
sBst.add(“W”);
sBst.add(“A”);
sBst.add(“R”);
sBst.add(“E”);
sBst.add(“A”);
sBst.add(“G”);
sBst.add(“L”);
sBst.add(“E”);
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.
*/
public void add(T element) {
// 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) {
// don’t add a duplicate
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++;
}
}
}
They have a magnificent team. These people are always kind and willing to listen to your concerns or issues. Better yet, your assignment is always ready before the time, they usually send you a draft to double-check before they finalize your paper.
Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.
You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.
Read moreEach paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.
Read moreThanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.
Read moreYour email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.
Read moreBy sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.
Read more