public void CanFindNextNodeWithoutLeftLeaf()
{
BinaryTree <string> bt = new BinaryTree <string>();
bt.Add("first");
bt.AddAtPosition(bt.Root, "right", "second");
Assert.Equal(bt.Root.Value, bt.FindNextAvailableRoot().Value);
}