public void Add(int val)
{
BstNode runner = this.Root;
if (runner is null)
{
this.Root = new BstNode(val);
}
while (runner != null)
{
if (val < runner.Value)
{
if (runner.Left is null)
{
runner.Left = new BstNode(val);
return;
}
runner = runner.Left;
}
else
{
if (runner.Right is null)
{
runner.Right = new BstNode(val);
return;
}
runner = runner.Right;
}
}
}
int Size(BstNode node)
{
if (node is null)
{
return(0);
}
return(1 + Size(node.Right) + Size(node.Left));
}
public void BSTtoArr(BstNode node, List <BstNode> nodes)
{
if (node != null)
{
return;
}
BSTtoArr(node.Left, nodes);
nodes.Add(node);
BSTtoArr(node.Right, nodes);
}
public BstNode BuildBST(List <BstNode> nodes, int start, int end)
{
if (start > end)
{
return(null);
}
int mid = (start + end) / 2;
BstNode node = nodes[mid];
node.Left = BuildBST(nodes, start, mid - 1);
node.Right = BuildBST(nodes, mid + 1, end);
return(node);
}
public bool Contains(int val)
{
BstNode runner = this.Root;
while (runner != null)
{
if (runner.Value == val)
{
return(true);
}
if (val < runner.Value)
{
runner = runner.Left;
}
else
{
runner = runner.Right;
}
}
return(false);
}
public void Remove(int val)
{
if (Root is null)
{
throw new InvalidOperationException("Cannot remove from an empty tree.");
}
if (Root.Value == val)
{
throw new InvalidOperationException("Don't have this logic yet");
}
BstNode runner = Root;
while (runner != null)
{
if (val < runner.Value)
{
if (runner.Left.Value == val)
{
BstNode temp = runner.Left;
if (temp.Right != null)
{
runner.Left = temp.Left;
}
if (temp.Left != null)
{
runner.Left.Right = temp.Right;
}
if (temp.Right is null && temp.Left is null)
{
runner.Left = null;
}
return;
}
runner = runner.Left;
}
else
{
if (runner.Right.Value == val)
{
BstNode temp = runner.Right;
if (temp.Right != null)
{
runner.Right = temp.Right;
}
if (temp.Left != null)
{
runner.Right.Left = temp.Left;
}
if (temp.Right is null && temp.Left is null)
{
runner.Right = null;
}
return;
}
runner = runner.Right;
}
}
}
