285 (2) update iterative solution

stevencooks · stevencooks · commit 92b23a44db90 · 2015-09-30T14:41:43.000-04:00
diff --git a/src/_285_InorderSuccessorInBST/Solution.java b/src/_285_InorderSuccessorInBST/Solution.java
@@ -19,7 +19,6 @@
 import com.leetcode.TreeNode;
 
 /** see test {@link _285_InorderSuccessorInBST.SolutionTest } */
-
 public class Solution {
 
     // iterative version
@@ -36,10 +35,8 @@ public TreeNode inorderSuccessor(TreeNode root, TreeNode node) {
         } else {
             // find successor from root down to this node
             TreeNode successor = null;
-            while (root != null) {
-                if (root == node) {
-                    break;
-                } else if (node.val < root.val) {
+            while (root != null && root != node) {
+                if (node.val < root.val) {
                     // go to left subtree
                     successor = root;
                     root = root.left;
