LeetCode Solution, Medium, 669. Trim a Binary Search Tree

669. Trim a Binary Search Tree 題目敘述 Given the root of a binary search tree and the lowest and highest boundaries as low and high, trim the tree so that all its elements lies in [low, high]. Trimming the tree should not change the relative structure o...