Build Binary Search Tree - C#
Join the DZone community and get the full member experience.
Join For FreeBuild Binary Search Tree - C#
Efficiency: O(n)
public static BinaryTreeNode BuildBinarySearchTree(int[] sortedArray)
{
if (sortedArray.Length == 0)
return null;
int _mid = sortedArray.Length / 2;
BinaryTreeNode _root = new BinaryTreeNode(sortedArray[_mid]);
int[] _left = GetSubArray(sortedArray, 0, _mid - 1);
int[] _right = GetSubArray(sortedArray, _mid + 1, sortedArray.Length - 1);
_root.Left = BuildBinarySearchTree(_left);
_root.Right = BuildBinarySearchTree(_right);
return _root;
}
public int[] GetSubArray(int[] array, int start, int end)
{
List _result = new List();
for (int i = start; i <= end; i++)
{
_result.Add(array[i]);
}
return _result.ToArray();
}
Binary search tree
Build (game engine)
Tree (data structure)
Opinions expressed by DZone contributors are their own.
Comments