//print Method functions
public void Print(node root, int topMargin = 2, int leftMargin = 2)
{
if (root == null)
{
return;
}
int rootTop = Console.CursorTop + topMargin;
var last = new List <node>();
var next = root;
for (int level = 0; next != null; level++)
{
var item = new node {
Data = next.Data.ToString(" 0 ")
};
item.SetLeft(next.GetLeft());
item.SetRight(next.GetRight());
if (level < last.Count)
{
item.StartPos = last[level].EndPos + 1;
last[level] = item;
}
else
{
item.StartPos = leftMargin;
last.Add(item);
}
if (level > 0)
{
item.SetParent(last[level - 1]);
if (next == item.GetParent().GetLeft())
{
item.GetParent().SetLeft(item);
item.EndPos = Math.Max(item.EndPos, item.GetParent().StartPos);
}
else
{
item.GetParent().SetRight(item);
item.StartPos = Math.Max(item.StartPos, item.GetParent().EndPos);
}
}
next = next.GetLeft() ?? next.GetRight();
for (; next == null; item = item.GetParent())
{
Print(item, rootTop + 2 * level);
if (--level < 0)
{
break;
}
if (item == item.GetParent().GetLeft())
{
item.GetParent().StartPos = item.EndPos;
next = item.GetParent().GetRight();
}
else
{
if (item.GetParent().GetLeft() == null)
{
item.GetParent().EndPos = item.StartPos;
}
else
{
item.GetParent().StartPos += (item.StartPos - item.GetParent().EndPos) / 2;
}
}
}
}
Console.SetCursorPosition(0, rootTop + 2 * last.Count - 1);
}
public bool Delete(dynamic _Data)
{
//Traverse to the node we are trying to delete
Current = Root;
//try statement will run unless the node does not exitst, in which case it will throw an exception and return false.
try
{
while (true)
{
if (_Data != Current.Data)
{
Current = Traverse(_Data, Current);
}
else
{
break;
}
}
}
catch
{
//If it can't be found, return false
return(false);
}
if (Current.GetLeft() != null && Current.GetRight() != null)
{
//If it has 2 children
node temp = Current.GetLeft();
//Traverse to node that will replace Current
while (true)
{
if (temp.GetRight() != null)
{
temp = temp.GetRight();
}
else
{
break;
}
}
Current.Data = temp.Data;
//Find if the temp node is a left or a right node before deleting.
if (temp.GetParent() == Current)
{
//If the current node is parent to our replacing node. (Only 1 level down)
Current.SetLeft(temp.GetLeft());
if (temp.GetLeft() != null)
{
temp.GetLeft().SetParent(temp.GetParent());
}
}
else
{
//If we could traverse down the left hand side
if (temp.GetLeft() != null)
{
temp.GetParent().SetRight(temp.GetLeft());
temp.GetLeft().SetParent(temp.GetParent());
}
else
{
temp.GetParent().SetRight(null);
}
}
return(true);
}
else if (Current.GetLeft() != null || Current.GetRight() != null)
{
bool LeftFlag = false;
if (Current == Root)
{
if (Current.GetLeft() != null)
{
Root = Current.GetLeft();
}
else
{
Root = Current.GetRight();
}
return(true);
}
if (Current.Data < Current.GetParent().Data)
{
LeftFlag = true;
}
if (Current.GetLeft() != null)
{//If it has a left child
if (LeftFlag == true)
{
Current.GetParent().SetLeft(Current.GetLeft());
}
else
{
Current.GetParent().SetRight(Current.GetLeft());
}
Current.GetLeft().SetParent(Current.GetParent());
}
else //If it has a right child
{
if (LeftFlag == true)
{
Current.GetParent().SetLeft(Current.GetRight());
}
else
{
Current.GetParent().SetRight(Current.GetRight());
}
Current.GetRight().SetParent(Current.GetParent());
}
return(true);
}
else
{
//If it has no children
if (Current == Root)
{
Root = null;
return(true);
}
else
{
//Set the parent's relevent pointer to null
if (Current.Data <= Current.GetParent().Data)
{
Current.GetParent().SetLeft(null);
return(true);
}
else
{
Current.GetParent().SetRight(null);
return(true);
}
}
}
}
public tree(dynamic _Data = null)
{
//New tree - Sets the Root of the tree to a new node
Root = new node(_Data);
}