public Tuple <AvlTreeIterator <T>, bool> Add(T value)
{
var it = this.LowerBound(value);
if (it.Node == null)
{
var newNode = new AvlNode <T>(value);
if (this.root == null)
{
this.root = newNode;
var newRootIt = new AvlTreeIterator <T>(this.root);
return(new Tuple <AvlTreeIterator <T>, bool>(newRootIt, true));
}
else
{
var node = this.root;
while (node.Right != null)
{
node = node.Right;
}
node.Right = newNode;
node.Right.Parent = node;
node.Update();
var newNodeIt = new AvlTreeIterator <T>(newNode);
return(new Tuple <AvlTreeIterator <T>, bool>(newNodeIt, true));
}
}
if (it.Node.Value.CompareTo(value) == 0)
{
return(new Tuple <AvlTreeIterator <T>, bool>(it, false));
}
{
var newNode = new AvlNode <T>(value);
if (it.Node.Left == null)
{
it.Node.Left = newNode;
it.Node.Left.Parent = it.Node;
}
else
{
it.MoveLeft();
it.Node.Right = newNode;
it.Node.Right.Parent = it.Node;
}
it.Node.Update();
var newIt = new AvlTreeIterator <T>(newNode);
return(new Tuple <AvlTreeIterator <T>, bool>(newIt, true));
}
}
public AvlTreeIterator <T> LowerBound(T value)
{
var node = this.root;
if (node == null)
{
return(this.End);
}
while (true)
{
var cmp = value.CompareTo(node.Value);
if (cmp < 0)
{
if (node.Left == null)
{
return(new AvlTreeIterator <T>(node));
}
node = node.Left;
}
else if (cmp > 0)
{
if (node.Right == null)
{
var it = new AvlTreeIterator <T>(node);
it.MoveRight();
return(it);
}
node = node.Right;
}
else
{
return(new AvlTreeIterator <T>(node));
}
}
}
public void Remove(AvlTreeIterator <T> iterator)
{
throw new NotImplementedException();
}
