@Test public void shouldReturnTrueIfTheTreeContainsJustOneNodeIterative() { BinaryNode<Integer> root = new BinaryNode<Integer>(0); assertTrue(isBST.checkIterative(root)); }
public boolean checkIterative(BinaryNode<Integer> root) { validateInput(root); List<BinaryNode<Integer>> nodesInOrder = binaryTreeInOrder.getRecursive(root); return isListOrdered(nodesInOrder); }
IsBST { public boolean checkIterative(BinaryNode<Integer> root) { validateInput(root); List<BinaryNode<Integer>> nodesInOrder = binaryTreeInOrder.getRecursive(root); return isListOrdered(nodesInOrder); } }
IsBST { public boolean checkIterative(BinaryNode<Integer> root) { validateInput(root); List<BinaryNode<Integer>> nodesInOrder = binaryTreeInOrder.getRecursive(root); return isListOrdered(nodesInOrder); }  }
IsBST { public boolean checkIterative(BinaryNode<Integer> root) { validateInput(root); List<BinaryNode<Integer>> nodesInOrder = binaryTreeInOrder.getRecursive(root); return isListOrdered(nodesInOrder); }  boolean checkRecursive(BinaryNode<Integer> root); boolean checkIterative(BinaryNode<Integer> root); }
IsBST { public boolean checkIterative(BinaryNode<Integer> root) { validateInput(root); List<BinaryNode<Integer>> nodesInOrder = binaryTreeInOrder.getRecursive(root); return isListOrdered(nodesInOrder); }  boolean checkRecursive(BinaryNode<Integer> root); boolean checkIterative(BinaryNode<Integer> root);  }