public BinaryTree(BinaryTreeNode root)
{
this.root = root;
}
public static BinaryTreeNode <T> CreateBinaryTree <T>(T data, BinaryTreeNode <T> left, BinaryTreeNode <T> right)
where T : IEquatable <T>
{
return(new BinaryTreeNode <T>(data, left, right));
}
private static void ValidateInput(int size, BinaryTreeNode <int> expectedResult)
{
var result = Question4_2.MakeMinimalBinarySearchTree(Enumerable.Range(0, size).ToArray());
TreeHelpers.AssertBinaryTreesAreEqual(result, expectedResult);
}
