zoukankan      html  css  js  c++  java
  • [Algorithm] Check if a binary tree is binary search tree or not

    What is Binary Search Tree (BST)

    A binary tree in which for each node, value of all the nodes in left subtree is less or equal and value of all the nodes in right subtree is greater

    The idea:

    We can use set boundry for each node. We take C tree for example:

    For root node, the B (bountry) = [MIN, MAX]

    node 4: B = [MIN, 7] // cannot be greater than 7

    node 1: B = [MIN, 4]

    node 6: B = [4, 7] // cannot less than 4, but should less than 7.

    node 9: B = [7, MAX] // cannot less than 7

    function Node(val) {
      return {
        val,
        left: null,
        right: null
      };
    }
    
    function Tree() {
      return {
        root: null,
        addLeft(val, root) {
          const node = Node(val);
          root.left = node;
          return root.left;
        },
        addRight(val, root) {
          const node = Node(val);
          root.right = node;
          return root.right;
        }
      };
    }
    
    function isBinarySearchTree(root) {
      function helper(root, max, min) {
        if (root == null) {
          return true;
        }
    
        if (
          root.val >= min &&
          root.val <= max &&
          helper(root.left, root.val, min) &&
          helper(root.right, max, root.val)
        ) {
          return true;
        } else {
          return false;
        }
      }
    
      return helper(root, Number.MAX_VALUE, Number.MIN_VALUE);
    }
    
    const tree = new Tree();
    const root = Node(10);
    tree.root = root;
    const ll1 = tree.addLeft(5, tree.root);
    tree.addRight(16, tree.root);
    const ll2 = tree.addLeft(4, ll1);
    const lr2 = tree.addRight(7, ll1);
    tree.addLeft(1, ll2);
    tree.addRight(11, lr2);
    tree.addRight(16, tree.root);
    
    /*
                 10
               /    
             5       16
           /   
         4      7 
        /        
      1           11  
    
    11 is greater than 10, which is false
    
    */
    
    const res1 = isBinarySearchTree(root); // false
    console.log(res1);
    
    const tree2 = new Tree();
    const root2 = Node(7);
    tree2.root = root2;
    const _ll1 = tree.addLeft(4, tree.root);
    tree.addRight(9, tree.root);
    tree.addLeft(1, _ll1);
    tree.addRight(6, _ll1);
    
    /*
    
              7
             /   
           4    9 
          / 
         1   6
    */
    
    const res2 = isBinarySearchTree(root2); // true
    console.log(res2);
  • 相关阅读:
    使用Angular2建立项目
    你不知道的JavaScript-0
    项目从0到1
    登录页跳转时保存用户信息-遇坑记
    robotframework-ride快捷方式打不开
    win10 python3.8 wxpython.whl 安装步骤
    QPS
    xmind 文件 打开后会在当前目录生成 configuration,p2和workspace目录,artifacts.xml文件 解决
    JMeter进行压力测试时查看服务器的资源使用
    JMeter和JMeterPlugin的下载安装
  • 原文地址:https://www.cnblogs.com/Answer1215/p/10634294.html
Copyright © 2011-2022 走看看