669. 修剪二叉搜索树

题目链接

import { initTree, TreeNode } from './utils/ts-index';

function trimBST(root: TreeNode | null, low: number, high: number): TreeNode | null {
    if(!root) return root;
    if(root.val > high) {
        return trimBST(root.left, low, high);
    };
    if(root.val < low) {
        return trimBST(root.right, low, high);
    }
    root.left = trimBST(root.left, low, high);
    root.right = trimBST(root.right, low, high);
    return root;
};

(()=> {
    const root = initTree([3,0,4,null,2,null,null,null,null,1]);
    console.log('trimBST', trimBST(root,0,4));
})();