public void Example1()
{
var sol = new ConvertSortedListToBinarySearchTree();
var tree = sol.SortedListToBST(new ListNode("-10 -3 0 5 9"));
Assert.IsNotNull(tree);
}
public void Test1()
{
var problem = new ConvertSortedListToBinarySearchTree();
var input = GetInput1();
var expectedOutput = new List <int>()
{
1, 2, 3, 4, 5, 6, 7, 8, 9
};
var output = problem.Solve(input);
var traversal = new List <int>();
InOrderTraversal(output, traversal);
CollectionAssert.AreEqual(expectedOutput, traversal);
}
