Update closest-binary-search-tree-value-ii.cpp

Author: kamyu104

C++/closest-binary-search-tree-value-ii.cpp

@@ -35,12 +35,12 @@ class Solution {
         // Get the closest k values by advancing the iterators of the stacks.
         vector<int> result;
         for (int i = 0; i < k; ++i) {
-            if (backward_stack.empty() ||
-                (!forward_stack.empty() && closest(forward_stack.back(), backward_stack.back()))) {
+            if (!forward_stack.empty() && 
+                (backward_stack.empty() || closest(forward_stack.back(), backward_stack.back()))) {
                 result.emplace_back(forward_stack.back()->val);
                 nextNode(forward_stack, forward, backward);
-            } else if (forward_stack.empty() ||
-                       (!backward_stack.empty() && !closest(forward_stack.back(), backward_stack.back()))) {
+            } else if (!backward_stack.empty() &&
+                       (forward_stack.empty() || !closest(forward_stack.back(), backward_stack.back()))) {
                 result.emplace_back(backward_stack.back()->val);
                 nextNode(backward_stack, backward, forward);
             }