{"id":27224,"date":"2018-01-05T21:45:21","date_gmt":"2018-01-05T16:15:21","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27224"},"modified":"2018-10-29T11:16:17","modified_gmt":"2018-10-29T05:46:17","slug":"java-program-check-binary-tree-bst-not","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-program-check-binary-tree-bst-not\/","title":{"rendered":"Java program to check if a binary tree is BST or not"},"content":{"rendered":"

Binary Search Tree (BST):<\/h2>\n

A binary search tree<\/a> (BST<\/strong>) is a node based binary tree data structure<\/strong> which has the following properties.<\/span>
\n\u2022 The left subtree<\/strong> of a node contains only nodes with keys less than the node\u2019s key.
\n\u2022 The right subtree<\/strong> of a node contains only nodes with keys greater than the node\u2019s key.
\n\u2022 Both the left and right subtrees must also be binary search trees.<\/strong><\/p>\n

From the above properties it naturally follows that:<\/strong>
\n\u2022 Each node (item in the tree) has a distinct key<\/strong>.<\/p>\n

\n

Java program to check if a binary tree is BST:<\/span><\/h3>\n

METHOD 1 (Correct and Efficient):<\/strong><\/span><\/h3>\n

A better solution looks at each node only once. The trick is to write a utility helper function is BST Util(struct node* node, int min, int max)<\/strong> that traverses down the tree keeping track of the narrowing min and max allowed values as it goes, looking at each node only once. The initial values for min and max should be INT_MIN and INT_MAX<\/strong> \u2014 they narrow from there.<\/p>\n

\/* Returns true if the given tree is a binary search tree \r\n (efficient version). *\/ \r\nint isBST(struct node* node) \r\n{ \r\n  return(isBSTUtil(node, INT_MIN, INT_MAX)); \r\n} \r\n\r\n\/* Returns true if the given tree is a BST and its \r\n values are >= min and <= max. *\/ \r\nint isBSTUtil(struct node* node, int min, int max)<\/pre>\n<\/div>\n
Implementation:<\/strong><\/span><\/h3>\n
 
 Java Programming<\/span> <\/div> 
\/\/Java implementation to check if given Binary tree\/\/is a BST or not class Node{    int data;    Node left, right;     public Node(int item)    {        data = item;        left = right = null;    }} public class BinaryTree{        Node root;         boolean isBST()  {        return isBSTUtil(root, Integer.MIN_VALUE,                               Integer.MAX_VALUE);    }        boolean isBSTUtil(Node node, int min, int max)    {                if (node == null)            return true;                 if (node.data < min || node.data > max)            return false;                return (isBSTUtil(node.left, min, node.data-1) &&                isBSTUtil(node.right, node.data+1, max));    }         public static void main(String args[])    {        BinaryTree tree = new BinaryTree();        tree.root = new Node(4);        tree.root.left = new Node(2);        tree.root.right = new Node(5);        tree.root.left.left = new Node(1);        tree.root.left.right = new Node(3);         if (tree.isBST())            System.out.println("IS BST");        else            System.out.println("Not a BST");    }}<\/code><\/pre> <\/div>\n
Output:\u00a0<\/span><\/h3>\n
IS BST<\/pre>\n
Time Complexity:<\/strong> <\/span>O(n)<\/strong>
\nAuxiliary Space :<\/strong><\/span> O(1)<\/strong> if Function Call Stack size is not considered, otherwise O(n)<\/p>\n[ad type=”banner”]\n
Java program to check if a binary tree is BST:<\/span><\/h3>\n
METHOD 2(Using In-Order Traversal):<\/strong><\/span><\/h3>\n
1) Do In-Order Traversal<\/a> of the given tree and store the result in a temp array.
\n2) Check if the temp array is sorted in ascending order, if it is, then the tree is BST.<\/p>\n
Time Complexity:<\/strong><\/span> O(n)<\/strong><\/p>\n
We can avoid the use of Auxiliary Array<\/a>. While doing In-Order traversal, we can keep track of previously visited node. If the value of the currently visited node is less than the previous value, then tree is not BST.<\/p>\n
Implementation:<\/strong><\/span><\/h3>\n
 
 Java Programming<\/span> <\/div> 
class Node{    int data;    Node left, right;     public Node(int item)    {        data = item;        left = right = null;    }} public class BinaryTree{       Node root;       Node prev;     boolean isBST()  {        prev = null;        return isBST(root);    }       boolean isBST(Node node)    {            if (node != null)        {            if (!isBST(node.left))                return false;                 if (prev != null && node.data <= prev.data )                return false;            prev = node;            return isBST(node.right);        }        return true;    }     public static void main(String args[])    {        BinaryTree tree = new BinaryTree();        tree.root = new Node(4);        tree.root.left = new Node(2);        tree.root.right = new Node(5);        tree.root.left.left = new Node(1);        tree.root.left.right = new Node(3);         if (tree.isBST())            System.out.println("IS BST");        else            System.out.println("Not a BST");    }}<\/code><\/pre> <\/div>\n[ad type=”banner”]\n
Output:\u00a0<\/span><\/h3>\n
IS BST<\/pre>\n","protected":false},"excerpt":{"rendered":"
Java program to check if a binary tree is BST or not – A binary search tree (BST) is a node based binary tree data structure.<\/p>\n","protected":false},"author":1,"featured_media":31620,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,80126,1,2139],"tags":[80573,80564,81149,81143,81142,71207,81174,81173,70290,73814,80574,81180,70657,81144,81151,81185,81182],"class_list":["post-27224","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-algorithm","category-binary-search-tree","category-coding","category-java","tag-binary-tree-search-java","tag-bst-online","tag-check-if-binary-tree-is-balanced","tag-check-if-binary-tree-is-bst-c","tag-check-if-binary-tree-is-bst-java","tag-examples-of-trees","tag-implement-binary-tree-java","tag-java-code-for-binary-search","tag-java-program-for-binary-search","tag-java-tree","tag-program-of-binary-search-tree","tag-tree-in-data-structure-in-c","tag-tree-java","tag-valid-binary-search-tree","tag-what-is-balanced-binary-tree","tag-what-is-binary-tree-with-example","tag-write-ac-program-to-create-a-binary-tree"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27224","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=27224"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27224\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media\/31620"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27224"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27224"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27224"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}