/// <summary>
/// Recursively finds the position to add the latitude and longitude.
/// </summary>
/// <param name="node">current node the insert is at.</param>
/// <param name="latitude">Latitude to add.</param>
/// <param name="longitude">Longitude to add.</param>
private void addHelper(LocationBinaryNode node, double latitude, double longitude)
{
if (Math.Abs(node.Latitude - latitude) < Double.Epsilon)
{
node.AddLongitude(longitude);
return;
}
if (latitude < node.Latitude)
{
if (node.Left == null)
{
node.Left = new LocationBinaryNode(latitude, longitude);
return;
}
this.addHelper(node.Left, latitude, longitude);
}
else
{
if (node.Right == null)
{
node.Right = new LocationBinaryNode(latitude, longitude);
return;
}
this.addHelper(node.Right, latitude, longitude);
}
}
/// <summary>
/// Adds a LocationBinaryNode with the latitude and longitude to the tree.
/// </summary>
/// <param name="latitude">Latitude to add.</param>
/// <param name="longitude">Longitude to add.</param>
public void Add(double latitude, double longitude)
{
if (this.root == null)
{
this.root = new LocationBinaryNode(latitude, longitude);
return;
}
this.addHelper(this.root, latitude, longitude);
}
/// <summary>
/// In-Order Traversal of the location binary tree where at each node we are:
/// For each longitude, add the latitude and longitude pairs to the total sum
/// For each longitude (implies a latitude) add one to the total count.
/// </summary>
/// <param name="node">Current Node.</param>
/// <param name="points">Average Points.</param>
private void averagePoint(LocationBinaryNode node, double[] points)
{
if (node != null)
{
this.averagePoint(node.Left, points);
foreach (var currentLongitude in node.LongitudeList)
{
points[0] += node.Latitude;
points[1] += currentLongitude;
points[2]++;
}
this.averagePoint(node.Right, points);
}
}
/// <summary>
/// Recursively searches through the binary tree for the passed latitude and longitude.
/// </summary>
/// <param name="node">Current Node.</param>
/// <param name="latitude">Latitude to search for.</param>
/// <param name="longitude">Longitude to search for.</param>
private bool searchHelper(LocationBinaryNode node, double latitude, double longitude)
{
if (node == null)
{
return(false);
}
if (Math.Abs(node.Latitude - latitude) < Double.Epsilon)
{
return(node.HasLongitude(longitude));
}
if (latitude < node.Latitude)
{
return(this.searchHelper(node.Left, latitude, longitude));
}
else
{
return(this.searchHelper(node.Right, latitude, longitude));
}
}
/// <summary>
/// Initializes a new instance of the <see cref="T:com.kiranpatel.crimecluster.framework.LocationBinaryTree"/> class.
/// </summary>
/// <param name="latitude">Latitude.</param>
/// <param name="longitude">Longitude.</param>
public LocationBinaryTree(double latitude, double longitude)
{
this.root = new LocationBinaryNode(latitude, longitude);
}
