@@ -0,0 +1,2225 @@
+/*%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.problem65;%0A%0Aimport com.github.pedrovgs.binarytree.BinaryNode;%0Aimport org.junit.Before;%0Aimport org.junit.Test;%0A%0Aimport static org.junit.Assert.assertFalse;%0Aimport static org.junit.Assert.assertTrue;%0A%0A/**%0A * @author Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A */%0Apublic class IsTreeBalancedTest %7B%0A%0A  private IsTreeBalanced isTreeBalanced;%0A%0A  @Before public void setUp() %7B%0A    isTreeBalanced = new IsTreeBalanced();%0A  %7D%0A%0A  @Test public void shouldReturnTrueIfTreeIsNull() %7B%0A    boolean isBalanced = isTreeBalanced.check(null);%0A%0A    assertTrue(isBalanced);%0A  %7D%0A%0A  @Test public void shouldReturnFalseIfTreeIsNotBalanced() %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    root.setLeft(n1);%0A    root.setRight(n2);%0A    n1.setLeft(n3);%0A    n3.setLeft(n4);%0A%0A    boolean isBalanced = isTreeBalanced.check(root);%0A%0A    assertFalse(isBalanced);%0A  %7D%0A%0A  @Test public void shouldReturnTrueIfTreeIsBalanced() %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    root.setLeft(n1);%0A    root.setRight(n2);%0A    n1.setLeft(n3);%0A    n2.setRight(n4);%0A%0A    boolean isBalanced = isTreeBalanced.check(root);%0A%0A    assertTrue(isBalanced);%0A  %7D%0A%7D%0A

Add some tests to problem 65