public void Reset()
{
progress = null;
current = null;
}
/// <summary>
/// Time complexity: O(n).
/// </summary>
/// <param name="point">The co-ordinate.</param>
/// <param name="value">The value associated with this co-ordinate if any.</param>
public void Insert(Point point, T value = default(T))
{
root = insert(root, point, value);
Count++;
}
internal QuadTreeEnumerator(QuadTreeNode <T> root)
{
this.root = root;
}