public virtual BinnaryNode <T> Find(T value)
{
BinnaryNode <T> node = root;
while (node != null)
{
if (node.Value.Equals(value))
{
return(node);
}
else
{
bool searchLeft = comparer((IComparable)value, (IComparable)node.Value) < 0;
if (searchLeft)
{
node = node.LeftChild;
}
else
{
node = node.RightChild;
}
}
}
return(null);
}
public virtual void InOrderHelper(BinnaryNode <T> node)
{
if (node == null)
{
return;
}
InOrderHelper(node.LeftChild);
Console.Write(node.Value + " ");
InOrderHelper(node.RightChild);
}
public virtual void Postorder(BinnaryNode <T> node)
{
if (node == null)
{
return;
}
Postorder(node.LeftChild);
Postorder(node.RightChild);
Console.Write(node.Value + " ");
}
public virtual int GetHeight(BinnaryNode <T> startNode)
{
if (startNode == null)
{
return(0);
}
else
{
return(1 + Math.Max(GetHeight(startNode.LeftChild), GetHeight(startNode.RightChild)));
}
}
public virtual void Preorder(BinnaryNode <T> node)
{
if (node == null)
{
return;
}
/* first print data of node */
Console.Write(node.Value + " ");
/* then recur on left sutree */
Preorder(node.LeftChild);
/* now recur on right subtree */
Preorder(node.RightChild);
}
public virtual void AddHelper(BinnaryNode <T> node)
{
if (this.root == null)
{
root = node;
node.Tree = this;
size++;
}
else
{
if (node.Parent == null)
{
node.Parent = root;
}
bool insertLeftSide = comparer((IComparable)node.Value, (IComparable)node.Parent.Value) <= 0;
if (insertLeftSide)
{
if (node.Parent.LeftChild == null)
{
node.Parent.LeftChild = node;
size++;
node.Tree = this;
}
else
{
node.Parent = node.Parent.LeftChild;
AddHelper(node);
}
}
else
{
if (node.Parent.RightChild == null)
{
node.Parent.RightChild = node;
size++;
node.Tree = this;
}
else
{
node.Parent = node.Parent.RightChild;
AddHelper(node);
}
}
}
}
public virtual void Add(T value)
{
BinnaryNode <T> node = new BinnaryNode <T>(value);
AddHelper(node);
}
public BinaryTree()
{
root = null;
size = 0;
}
public virtual void RemoveHelper(BinnaryNode <T> removeNode)
{
if (removeNode == null || removeNode.Tree != this)
{
Console.WriteLine("Nod not founded");
}
bool wasHead = (removeNode == root);
if (Count == 1)
{
root = null;
removeNode.Tree = null;
size--;
}
else if (removeNode.RightChild == null && removeNode.RightChild == null)
{
if (removeNode.Parent != null && removeNode.Parent.LeftChild == removeNode)
{
removeNode.Parent.LeftChild = null;
}
else
{
removeNode.Parent.RightChild = null;
}
removeNode.Tree = null;
removeNode.Parent = null;
size--;
}
else if ((removeNode.RightChild == null || removeNode.RightChild == null))
{
if (removeNode.Parent != null && removeNode.Parent.LeftChild == removeNode)
{
removeNode.LeftChild.Parent = removeNode.Parent;
if (wasHead)
{
Root = removeNode.LeftChild;
}
if ((removeNode.Parent != null && removeNode.Parent.LeftChild == removeNode))
{
removeNode.Parent.LeftChild = removeNode.LeftChild;
}
else
{
removeNode.Parent.RightChild = removeNode.LeftChild;
}
}
else
{
removeNode.RightChild.Parent = removeNode.Parent;
if (wasHead)
{
Root = removeNode.RightChild;
}
if ((removeNode.Parent != null && removeNode.Parent.LeftChild == removeNode))
{
removeNode.Parent.LeftChild = removeNode.RightChild;
}
else
{
removeNode.Parent.RightChild = removeNode.RightChild;
}
}
removeNode.Tree = null;
removeNode.Parent = null;
removeNode.LeftChild = null;
removeNode.RightChild = null;
size--;
}
else
{
BinnaryNode <T> successorNode = removeNode.LeftChild;
while (successorNode.RightChild != null)
{
successorNode = successorNode.RightChild;
}
removeNode.Value = successorNode.Value;
RemoveHelper(successorNode);
}
}
public virtual void Remove(T value)
{
BinnaryNode <T> removeNode = Find(value);
RemoveHelper(removeNode);
}
