diff --git a/17_Binary Search Trees (1)/PrintInRange.java b/17_Binary Search Trees (1)/PrintInRange.java
index 1d9f42b..78a8215 100644
--- a/17_Binary Search Trees (1)/PrintInRange.java	
+++ b/17_Binary Search Trees (1)/PrintInRange.java	
@@ -26,24 +26,17 @@ public static Node insert(Node root, int val) {
          return root;
     }
 
-    public static void printInRange(Node root, int k1, int k2) {
-        if(root == null) {
+     public static void printInRange(Node root, int k1, int k2) {
+        if (root == null) {
             return;
         }
-
-        if(root.data >= k1 && root.data <= k2) {
-            printInRange(root.left, k1, k2);
-            System.out.print(root.data+" ");
-            printInRange(root.right, k1, k2);
-        }
-
-        else if(root.data > k2) {
+        if (k1 < root.data) {
             printInRange(root.left, k1, k2);
         }
-
-        else {
-            printInRange(root.right, k1, k2);
+        if (root.data >= k1 && root.data <= k2) {
+            System.out.print(root.data + " ");
         }
+        printInRange(root.right, k1, k2);
     }
 
     public static void main(String args[]) {