669-Trim-a-Binary-Search-Tree.ts

/**
 * Definition for a binary tree node.
 * class TreeNode {
 *     val: number
 *     left: TreeNode | null
 *     right: TreeNode | null
 *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
 *         this.val = (val===undefined ? 0 : val)
 *         this.left = (left===undefined ? null : left)
 *         this.right = (right===undefined ? null : right)
 *     }
 * }
 */

function trimBST(root: TreeNode | null, low: number, high: number): TreeNode | null {

    if (!root) {
		return null;
	}

	if (root.val < low) {
		return trimBST(root.right, low, high);
	}

	if (root.val > high) {
		return trimBST(root.left, low, high);
	}

	root.left  = trimBST(root.left, low, high);
	root.right = trimBST(root.right, low, high);

	return root;
};