FIX: moved condition to better place, based on the suggestion of the linter

src/mhtree/MHTree.java

@@ -57,7 +57,7 @@ public class MHTree extends Algorithm implements Serializable {
         PriorityQueue<ObjectToNodeDistanceRank> queue = new PriorityQueue<>();
         queue.add(new ObjectToNodeDistanceRank(root, object));
 
-        while (!queue.isEmpty() && operation.getAnswerCount() < operation.getK()) {
+        while (!queue.isEmpty()) {
             Node currentNode = queue.poll().getNode();
 
             if (currentNode.isLeaf()) {
@@ -67,6 +67,9 @@ public class MHTree extends Algorithm implements Serializable {
 
                     operation.addToAnswer(obj);
                 }
+
+                if (operation.getAnswerCount() >= operation.getK())
+                    break;
             } else {
                 for (Node child : ((InternalNode) currentNode).getChildren())
                     queue.add(new ObjectToNodeDistanceRank(child, object));