[LeetCode] 669. Trim a Binary Search Tree - 문제풀이
Description 이진검색트리의 root와 트리안의 최대값, 최소값이 주어졌을때 주어진 최대, 최소값을 Trim한뒤 반환해주는 문제입니다. 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 of the elements that will remain in the tree (i.e., any node's descendant should remain a descendant). It..
