int BinTree::HasLeftTree()
{
if (Cursor == NULL)
return False;
else if ((Cursor -> Left) == NULL))
return False;
else
return True;
}
void BinTree::GoLeft()
{
if (Cursor != NULL)
Cursor = Cursor -> Left;
}
void BinTree::DoInOrder(NodePtr Next, FcnType Visit)
{
if (Next != NULL)
{
DoInOrder(Next -> Left, Visit);
Visit(Next -> Info);
DoInOrder(Next -> Right, Visit);
}
}
void BinTree::InOrder(FcnType Visit)
{
DoInOrder(Root, Visit);
}