[失业前端恶补算法]JavaScript leetcode刷题笔记 98. 验证二叉搜索树

声明：只求用最简单的方法通过，不求优化，不喜勿喷

1. bst的中序遍历是递增的
2. 先中序遍历在判定是不是递增
3. 优化todo

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {boolean}
 */
var isValidBST = function (root) {
    let order = []
    let dfs = function (node) {
        if (node == null ) {
            return;
        }
        dfs(node.left )
        order.push(node.val)
        dfs(node.right )
        return ;
    }
    dfs(root);
    for (var i = 0; i < order.length-1; i++) {
        if(order[i]>=order[i+1]){
            return false;
        }
    }
    return true;
};