Given the root of a binary search tree with distinct values, modify it so that every node has a new value equal to the sum of the values of the original tree that are greater than or equal to node.val.
执行用时 :4 ms, 在所有 C++ 提交中击败了83.28%的用户 内存消耗 :9.3 MB, 在所有 C++ 提交中击败了100.00%的用户