Leetcode Problem 669. Trim a Binary Search Tree

669. Trim a Binary Search Tree

Leetcode Solutions

Define a recursive function trimBST(node, low, high) that takes the current node and the range [low, high] as arguments.
If node is null, return null.
If node.val is less than low, return the result of trimBST(node.right, low, high).
If node.val is greater than high, return the result of trimBST(node.left, low, high).
Recursively trim the left and right subtrees of node with trimBST(node.left, low, high) and trimBST(node.right, low, high), respectively.
Update node.left and node.right with the trimmed subtrees.
Return node as it is within the range and now has the correct trimmed subtrees.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen