public TreeIterator(BinaryTree <T> theTree)
{
t = theTree;
current = null;
}
public void setLeft(BinaryNode <T> node)
{
_left = node;
}
public void setRight(BinaryNode <T> node)
{
_right = node;
}
public void makeEmpty()
{
Root = null;
}
public BinaryNode(T element, BinaryNode <T> lt, BinaryNode <T> rt)
{
_element = element;
_left = lt;
_right = rt;
}
public int size()
{
return(BinaryNode <T> .size(Root));
}
public int height()
{
return(BinaryNode <T> .height(Root));
}
public BinaryTree(T rootItem)
{
Root = new BinaryNode <T>(rootItem);
}
public BinaryTree()
{
Root = null;
}
public void RemoveMin()
{
Root = RemoveMin(Root);
}
public void Remove(T x)
{
Root = Remove(x, Root);
}
public void Insert(T x)
{
Root = Insert(x, Root);
}
