Class BinarySearchTree<E extends Comparable<? super E>>

java.lang.Object

BinarySearchTree<E>

Type Parameters:

E - The data type of the elements of this BinartSearchTree. Must implement Comparable or inherit from a class that implements Comparable.

public class BinarySearchTree<E extends Comparable<? super E>>
extends Object

Shell for a binary search tree class.

Constructor Summary

Constructors

Constructor and Description
BinarySearchTree()

Method Summary

Modifier and Type	Method and Description
boolean	add(E value) Add the specified item to this Binary Search Tree if it is not already present.
E	get(int kth) Return the "kth" element in this Binary Search Tree.
List<E>	getAll() Return a list of all the elements in this Binary Search Tree.
List<E>	getAllGreaterThan(E value) Return a List with all values in this Binary Search Tree that are greater than the parameter value.
List<E>	getAllLessThan(E value) Return a List with all values in this Binary Search Tree that are less than the parameter value.
int	height() return the height of this Binary Search Tree.
boolean	isPresent(E value) Check to see if the specified element is in this Binary Search Tree.
boolean	iterativeAdd(E data) An add method that implements the add algorithm iteratively instead of recursively.
E	max() return the maximum value in this binary search tree.
E	min() return the minimum value in this binary search tree.
int	numNodesAtDepth(int d) Find the number of nodes in this tree at the specified depth.
void	printTree() Prints a vertical representation of this tree.
boolean	remove(E value) Remove a specified item from this Binary Search Tree if it is present.
int	size() Return how many elements are in this Binary Search Tree.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

BinarySearchTree

public BinarySearchTree()

Method Detail

add

public boolean add(E value)

Add the specified item to this Binary Search Tree if it is not already present.
pre: value != null
post: Add value to this tree if not already present. Return true if this tree changed as a result of this method call, false otherwise.

Parameters:

value - the value to add to the tree

Returns:

false if an item equivalent to value is already present in the tree, return true if value is added to the tree and size() = old size() + 1

get

public E get(int kth)

Return the "kth" element in this Binary Search Tree. If kth = 0 the smallest value (minimum) is returned. If kth = 1 the second smallest value is returned, and so forth.
pre: 0 <= kth < size()

Parameters:

kth - indicates the rank of the element to get

Returns:

the kth value in this Binary Search Tree

getAll

public List<E> getAll()

Return a list of all the elements in this Binary Search Tree.
pre: none
post: return a List object with all data from the tree in ascending order. If the tree is empty return an empty List

Returns:

a List object with all data from the tree in sorted order if the tree is empty return an empty List

getAllGreaterThan

public List<E> getAllGreaterThan(E value)

Return a List with all values in this Binary Search Tree that are greater than the parameter value. value != null

Parameters:

value - the cutoff value

Returns:

a List with all values in this tree that are greater than the parameter value. If there are no values in this tree greater than value return an empty list. The elements of the list are in ascending order.

getAllLessThan

public List<E> getAllLessThan(E value)

Return a List with all values in this Binary Search Tree that are less than the parameter value. value != null

Parameters:

value - the cutoff value

Returns:

a List with all values in this tree that are less than the parameter value. If there are no values in this tree less than value return an empty list. The elements of the list are in ascending order.

height

public int height()

return the height of this Binary Search Tree.
pre: none
post: return the height of this tree. If the tree is empty return -1, otherwise return the height of the tree

Returns:

the height of this tree or -1 if the tree is empty

isPresent

public boolean isPresent(E value)

Check to see if the specified element is in this Binary Search Tree.
pre: value != null
post: return true if value is present in tree, false otherwise

Parameters:

value - the value to look for in the tree

Returns:

true if value is present in this tree, false otherwise

iterativeAdd

public boolean iterativeAdd(E data)

An add method that implements the add algorithm iteratively instead of recursively.
pre: data != null
post: if data is not present add it to the tree, otherwise do nothing.

Parameters:

data - the item to be added to this tree

Returns:

true if data was not present before this call to add, false otherwise.

max

public E max()

return the maximum value in this binary search tree.
pre: size() > 0
post: return the largest value in this Binary Search Tree

Returns:

the maximum value in this tree

min

public E min()

return the minimum value in this binary search tree.
pre: size() > 0
post: return the smallest value in this Binary Search Tree

Returns:

the minimum value in this tree

numNodesAtDepth

public int numNodesAtDepth(int d)

Find the number of nodes in this tree at the specified depth.
pre: none

Parameters:

d - The target depth.

Returns:

The number of nodes in this tree at a depth equal to the parameter d.

printTree

public void printTree()

Prints a vertical representation of this tree. The tree has been rotated counter clockwise 90 degrees. The root is on the left. Each node is printed out on its own row. A node's children will not necessarily be at the rows directly above and below a row. They will be indented three spaces from the parent. Nodes indented the same amount are at the same depth.
pre: none

remove

public boolean remove(E value)

Remove a specified item from this Binary Search Tree if it is present.
pre: value != null
post: Remove value from the tree if present, return true if this tree changed as a result of this method call, false otherwise.

Parameters:

value - the value to remove from the tree if present

Returns:

false if value was not present returns true if value was present and size() = old size() - 1

size

public int size()

Return how many elements are in this Binary Search Tree.
pre: none
post: return the number of items in this tree

Returns:

the number of items in this Binary Search Tree