Trim a Binary Search Tree

Given the root of a binary search tree with distinct values and integers low and high with low at most high, remove every node whose value is outside the inclusive interval [low, high]. Preserve the...