public void MakeEmpty()
{
Root = null;
}
public BinaryTree(BinaryNode <T> rootNode)
{
Root = rootNode;
}
public BinaryTree(T rootItem)
{
Root = new BinaryNode <T>(rootItem, null, null);
}
public BinaryTree()
{
Root = null;
}
public BinaryNode(T element, BinaryNode <T> lt, BinaryNode <T> rt)
{
Element = element;
Left = lt;
Left = rt;
}
public StNode(BinaryNode <T> n)
{
timesPopped = 0;
node = n;
}
