public void insertRightAt(BinaryNode position)
{
position.right = new BinaryNode();
}
public void setNode(BinaryNode here, Player data)
{
here = new BinaryNode(data);
++numOfElements;
}
public void insertLeftAt(BinaryNode position)
{
position.left = new BinaryNode();
}
public BinaryTree()
{
root = null;
numOfElements = 0;
holder = new Queue <BinaryNode>();
}
public void replaceNode(Player el, BinaryNode left, BinaryNode right)
{
key = el;
this.left = left;
this.right = right;
}
public void ReplaceNode(Player el)
{
key = el;
left = right = null;
}
public BinaryNode(Player el)
{
key = el;
left = right = null;
}
public BinaryNode()
{
left = right = null;
}