Leetcode 669. Trim a Binary Search Tree

Given a BST and bounds [low, high], remove all nodes with values outside the interval while preserving the relative parent–child structure of remaining nodes; exploit the BST ordering to skip whole left or right subtrees and return the (possibly changed) new root.