private HashBinaryTreeNode <T> Add(HashBinaryTreeNode <T> node, HashBinaryTreeNode <T> currentNode = null)
{
if (RootNode == null)
{
node.ParentNode = null;
return(RootNode = node);
}
currentNode ??= RootNode;
node.ParentNode = currentNode;
int result = node.ItemsHashCode.CompareTo(currentNode.ItemsHashCode);
if (result == 0)
{
currentNode.Data.Add(node.Data.First());
return(currentNode);
}
if (result < 0)
{
if (currentNode.LeftNode != null)
{
return(Add(node, currentNode.LeftNode));
}
currentNode.LeftNode = node;
return(currentNode);
}
if (currentNode.RightNode != null)
{
return(Add(node, currentNode.RightNode));
}
currentNode.RightNode = node;
return(currentNode);
}
private HashBinaryTreeNode <T> FindNode(T data, HashBinaryTreeNode <T> startWithNode = null)
{
if (RootNode == null)
{
return(null);
}
startWithNode ??= RootNode;
int result = data.GetHashCode().CompareTo(startWithNode.ItemsHashCode);
return(result == 0 & startWithNode.Data.Contains(data) ? startWithNode :
result < 0 ? startWithNode.LeftNode == null ? null : FindNode(data, startWithNode.LeftNode) :
startWithNode.RightNode == null ? null : FindNode(data, startWithNode.RightNode));
}
private IEnumerable <T> GetTreeElements(HashBinaryTreeNode <T> root)
{
if (root == null)
{
yield break;
}
foreach (var item in root.Data)
{
yield return(item);
}
foreach (var value in GetTreeElements(root.LeftNode))
{
yield return(value);
}
foreach (var value in GetTreeElements(root.RightNode))
{
yield return(value);
}
}
private void Remove(HashBinaryTreeNode <T> node)
{
if (node == null)
{
return;
}
if (node == RootNode)
{
var leftBranch = node.LeftNode;
RootNode = node.RightNode;
if (leftBranch != null)
{
Add(leftBranch);
}
}
else
{
var leftBranch = node.LeftNode;
var rightBranch = node.RightNode;
switch (node.NodeSide)
{
case Side.Left:
node.ParentNode.LeftNode = null;
break;
case Side.Right:
node.ParentNode.RightNode = null;
break;
}
if (leftBranch != null)
{
Add(leftBranch);
}
if (rightBranch != null)
{
Add(rightBranch);
}
}
}