@Test public void shouldReturnFalseIfTreesAreNotEqualsRecursive() { BinaryNode<Integer> root = new BinaryNode<Integer>(0); BinaryNode<Integer> n1 = new BinaryNode<Integer>(1); root.setLeft(n1); BinaryNode<Integer> root1 = new BinaryNode<Integer>(0); assertFalse(binaryTreeEquals.areEqualsRecursive(root, root1)); }
public boolean areEqualsRecursive(BinaryNode tree1, BinaryNode tree2) { validateInput(tree1, tree2); return areEqualsInner(tree1, tree2); }
BinaryTreeEquals { public boolean areEqualsRecursive(BinaryNode tree1, BinaryNode tree2) { validateInput(tree1, tree2); return areEqualsInner(tree1, tree2); } }
BinaryTreeEquals { public boolean areEqualsRecursive(BinaryNode tree1, BinaryNode tree2) { validateInput(tree1, tree2); return areEqualsInner(tree1, tree2); }  }
BinaryTreeEquals { public boolean areEqualsRecursive(BinaryNode tree1, BinaryNode tree2) { validateInput(tree1, tree2); return areEqualsInner(tree1, tree2); }  boolean areEqualsRecursive(BinaryNode tree1, BinaryNode tree2); boolean areEqualsIterative(BinaryNode<Integer> tree1, BinaryNode<Integer> tree2); }
BinaryTreeEquals { public boolean areEqualsRecursive(BinaryNode tree1, BinaryNode tree2) { validateInput(tree1, tree2); return areEqualsInner(tree1, tree2); }  boolean areEqualsRecursive(BinaryNode tree1, BinaryNode tree2); boolean areEqualsIterative(BinaryNode<Integer> tree1, BinaryNode<Integer> tree2);  }