@@ -0,0 +1,2732 @@
+/*%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.app.problem19;%0A%0Aimport com.github.pedrovgs.app.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 BinaryTreeDepthTest %7B%0A%0A  private BinaryTreeDepth binaryTreeDepth;%0A%0A  @Before public void setUp() %7B%0A    binaryTreeDepth = new BinaryTreeDepth();%0A  %7D%0A%0A  @Test(expected = IllegalArgumentException.class) public void shouldNotAcceptNullBinaryNodes() %7B%0A    binaryTreeDepth.get(null);%0A  %7D%0A%0A  @Test public void shouldReturn1IfTreeContainsJustOneElement() %7B%0A    BinaryNode%3CInteger%3E root = new BinaryNode%3CInteger%3E(0);%0A%0A    int depth = binaryTreeDepth.get(root);%0A%0A    assertEquals(1, depth);%0A  %7D%0A%0A  @Test public void shouldCalculateBinaryTreeDepthEvenIfTreeContainsJustOneBigLeftBranch() %7B%0A    BinaryNode%3CInteger%3E root = new BinaryNode%3CInteger%3E(0);%0A    BinaryNode%3CInteger%3E n1 = new BinaryNode%3CInteger%3E(1);%0A    BinaryNode%3CInteger%3E n2 = new BinaryNode%3CInteger%3E(2);%0A    root.setLeft(n1);%0A    n1.setLeft(n2);%0A%0A    int depth = binaryTreeDepth.get(root);%0A%0A    assertEquals(3, depth);%0A  %7D%0A%0A  @Test public void shouldCalculateBinaryTreeDepthEvenIfTreeContainsJustOneBigRightBranch() %7B%0A    BinaryNode%3CInteger%3E root = new BinaryNode%3CInteger%3E(0);%0A    BinaryNode%3CInteger%3E n1 = new BinaryNode%3CInteger%3E(1);%0A    BinaryNode%3CInteger%3E n2 = new BinaryNode%3CInteger%3E(2);%0A    root.setRight(n1);%0A    n1.setRight(n2);%0A%0A    int depth = binaryTreeDepth.get(root);%0A%0A    assertEquals(3, depth);%0A  %7D%0A%0A  @Test public void shouldCalculateBinaryTreeDepthWithANormalBinaryTree() %7B%0A    BinaryNode%3CInteger%3E root = new BinaryNode%3CInteger%3E(0);%0A    BinaryNode%3CInteger%3E n1 = new BinaryNode%3CInteger%3E(1);%0A    BinaryNode%3CInteger%3E n2 = new BinaryNode%3CInteger%3E(2);%0A    BinaryNode%3CInteger%3E n3 = new BinaryNode%3CInteger%3E(3);%0A    BinaryNode%3CInteger%3E n4 = new BinaryNode%3CInteger%3E(4);%0A    BinaryNode%3CInteger%3E n5 = new BinaryNode%3CInteger%3E(5);%0A    root.setLeft(n1);%0A    root.setRight(n2);%0A    n1.setLeft(n3);%0A    n1.setRight(n4);%0A    n4.setLeft(n5);%0A%0A    int depth = binaryTreeDepth.get(root);%0A%0A    assertEquals(5, depth);%0A  %7D%0A%7D%0A

Add some tests to problem 19