@@ -0,0 +1,2498 @@
+/*%0A * Copyright (C) 2014 Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A *%0A * Licensed under the Apache License, Version 2.0 (the %22License%22);%0A * you may not use this file except in compliance with the License.%0A * You may obtain a copy of the License at%0A *%0A * http://www.apache.org/licenses/LICENSE-2.0%0A *%0A * Unless required by applicable law or agreed to in writing, software%0A * distributed under the License is distributed on an %22AS IS%22 BASIS,%0A * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.%0A * See the License for the specific language governing permissions and%0A * limitations under the License.%0A */%0Apackage com.github.pedrovgs.problem44;%0A%0Aimport com.github.pedrovgs.binarytree.BinaryNode;%0Aimport org.junit.Before;%0Aimport org.junit.Test;%0A%0Aimport static org.junit.Assert.assertEquals;%0A%0A/**%0A * @author Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A */%0Apublic class FindMinNumberAtPositionTest %7B%0A%0A  private FindMinNumberAtPosition findMinNumberAtPosition;%0A%0A  @Before public void setUp() %7B%0A    findMinNumberAtPosition = new FindMinNumberAtPosition();%0A  %7D%0A%0A  @Test(expected = IllegalArgumentException.class) public void shouldNotAcceptNullBinaryTrees() %7B%0A    findMinNumberAtPosition.find(null, 1);%0A  %7D%0A%0A  @Test(expected = IllegalArgumentException.class)%0A  public void shouldNotAcceptNegativePositionsToSearch() %7B%0A    BinaryNode%3CInteger%3E tree = new BinaryNode%3CInteger%3E(1);%0A    findMinNumberAtPosition.find(tree, -1);%0A  %7D%0A%0A  @Test(expected = IllegalArgumentException.class)%0A  public void shouldThrowExceptionIfPositionIsGreaterThanNumberOfElementsInTheTree() %7B%0A    BinaryNode%3CInteger%3E tree = new BinaryNode%3CInteger%3E(1);%0A    findMinNumberAtPosition.find(tree, 1);%0A  %7D%0A%0A  @Test public void shouldFindMinNumberAtPosition() %7B%0A    BinaryNode%3CInteger%3E root = new BinaryNode%3CInteger%3E(8);%0A    BinaryNode%3CInteger%3E n3 = new BinaryNode%3CInteger%3E(3);%0A    BinaryNode%3CInteger%3E n10 = new BinaryNode%3CInteger%3E(10);%0A    BinaryNode%3CInteger%3E n1 = new BinaryNode%3CInteger%3E(1);%0A    BinaryNode%3CInteger%3E n6 = new BinaryNode%3CInteger%3E(6);%0A    BinaryNode%3CInteger%3E n14 = new BinaryNode%3CInteger%3E(14);%0A    BinaryNode%3CInteger%3E n4 = new BinaryNode%3CInteger%3E(4);%0A    BinaryNode%3CInteger%3E n7 = new BinaryNode%3CInteger%3E(7);%0A    BinaryNode%3CInteger%3E n13 = new BinaryNode%3CInteger%3E(13);%0A%0A    root.setLeft(n3);%0A    root.setRight(n10);%0A    n3.setLeft(n1);%0A    n3.setRight(n6);%0A    n6.setLeft(n4);%0A    n6.setRight(n7);%0A    n10.setRight(n14);%0A    n14.setLeft(n13);%0A%0A    int result = findMinNumberAtPosition.find(root, 3);%0A%0A    assertEquals(4, result);%0A  %7D%0A%7D%0A

Add some tests to problem 44