commit

Change-Id: I820959b1cfc713576e66ee7653b8ab36ac7418c3

Author: Wang-Jun-Chao

[0669][Trim a Binary Search Tree]/src/Solution.java

@@ -13,11 +13,11 @@ public TreeNode trimBST(TreeNode root, int L, int R) {
 
         if (root.val == L) {
             root.left = null;
-            root.right = trimBST(root, L, R);
+            root.right = trimBST(root.right, L, R);
             return root;
         } else if (root.val == R) {
-            root.right = null;
             root.left = trimBST(root.left, L, R);
+            root.right = null;
             return root;
         } else if (root.val < L) {
             return trimBST(root.right, L, R);