@@ -0,0 +1,1827 @@
+/*%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.problem18;%0A%0A/**%0A * Given a binary tree passed as argument, can you write a method to return true if the binary tree%0A * is a Binary Search Tree?%0A *%0A * A Binary Search Tree (BST), sometimes also called an ordered or sorted binary tree, is a%0A * node-based binary tree data structure where each node has a comparable key (and an associated%0A * value) and satisfies the restriction that the key in any node is larger than the keys in all%0A * nodes in that node's left sub-tree and smaller than the keys in all nodes in that node's right%0A * sub-tree. Each node has no more than two child nodes. Each child must either be a leaf node or%0A * the root of another binary search tree. The left sub-tree contains only nodes with keys less%0A * than%0A * the parent node; the right sub-tree contains only nodes with keys greater than the parent node.%0A * BSTs are also dynamic data structures, and the size of a BST is only limited by the amount of%0A * free memory in the operating system. The main advantage of binary search trees is that it%0A * remains%0A * ordered, which provides quicker search times than many other data structures.%0A *%0A * @author Pedro Vicente G%C3%B3mez S%C3%A1nchez.%0A */%0Apublic class IsBST %7B%0A%7D%0A

Add statement to problem 18