16. Check if it is BST

Source: Internet
Author: User
Title Description

Implement a function to check whether a binary tree is a two-fork lookup tree.

The root node pointer of the given tree treenode* root, returns a bool that represents whether the tree is a two-fork lookup tree

Import Java.util.*;/*public class TreeNode {    int val = 0;    TreeNode left = null;    TreeNode right = null;    Public TreeNode (int val) {        this.val = val;    }} */public class Checker {public    Boolean checkbst (TreeNode root) {        if (root==null) return true;        Boolean b1=checkbst (root.left);        Boolean b2= Checkbst (root.right);        if (B1 && b2) {            if (root.left!=null && root.left.val>root.val)                return false;            if (root.right!=null && root.right.val<root.val)                return false;            return true;        } else            return false;}    }


16. Check if it is BST

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.