public T Max(SimpleBinaryTreeNode <T> Node)
{
var tempNode = Node;
if (tempNode.left != null)
{
tempScore = tempNode.left.value;
if (tempScore.CompareTo(_root.value) == 1)
{
tempScore = tempNode.left.value;
Max(tempNode.left);
}
else
{
Max(tempNode.left);
}
}
if (tempNode.right != null)
{
tempScore = tempNode.right.value;
if (tempScore.CompareTo(_root.value) == 1)
{
tempScore = tempNode.right.value;
Max(tempNode.right);
}
else
{
Max(tempNode.right);
}
}
return(tempNode.value);
}
public List <T> Overfifty(SimpleBinaryTreeNode <T> Node)
{
var tempNode = Node;
var obj = new Applicant {
Score = 50
};
if (tempNode.left != null)
{
if (tempNode.left.value.CompareTo(obj) == 1)
{
tempHigh.Add(tempNode.left.value);
Overfifty(tempNode.left);
}
else
{
Overfifty(tempNode.left);
}
}
if (tempNode.right != null)
{
if (tempNode.right.value.CompareTo(obj) == 1)
{
tempHigh.Add(tempNode.right.value);
Overfifty(tempNode.right);
}
else
{
Overfifty(tempNode.right);
}
}
return(tempHigh);
}
protected string TreeToString(SimpleBinaryTreeNode <T> node)
{
if (node == null)
{
return("");
}
return(TreeToString(node.left) + node.value + TreeToString(node.right));
}
protected void Add(T item, ref SimpleBinaryTreeNode <T> node)
{
if (node == null)
{
node = new SimpleBinaryTreeNode <T>(item);
}
else if (item.CompareTo(node.value) == -1)
{
Add(item, ref node.left);
}
else
{
Add(item, ref node.right);
}
}
protected SimpleBinaryTreeNode <T> Find(T item, SimpleBinaryTreeNode <T> node)
{
if (node != null)
{
if (item.CompareTo(node.value) == 0)
{
return(node);
}
else if (item.CompareTo(node.value) == -1)
{
return(Find(item, node.left));
}
else
{
return(Find(item, node.right));
}
}
return(null);
}
