diff --git a/src/main/java/ds/bplus/bptree/BPlusTree.java b/src/main/java/ds/bplus/bptree/BPlusTree.java
index 1d36cd2..556f942 100644
--- a/src/main/java/ds/bplus/bptree/BPlusTree.java
+++ b/src/main/java/ds/bplus/bptree/BPlusTree.java
@@ -1563,7 +1563,6 @@ private TreeNode handleLeafNodeRedistributionOrMerging(TreeNode mnode,
 
         int nnum = canRedistribute(nptr);
         int pnum = canRedistribute(pptr);
-        int snum = canRedistribute(splitNode);
         boolean isLeftOfNext = (parentPointerIndex > parentKeyIndex);
         boolean splitNodeIsLeftChild = parentKeyIndex == parentPointerIndex;
 
@@ -1587,22 +1586,6 @@ else if(pnum > 0 && ppar) {
             } else {
                 redistributeNodes(splitNode, pptr, true, parent, parentKeyIndex);
             }
-        } else if(snum > 0) {
-            if(nptr != null) {
-                //System.out.println("\t -- Redistributing next node with elements from split");
-                if(splitNodeIsLeftChild) {
-                    redistributeNodes(nptr, splitNode, true, parent, parentKeyIndex);
-                } else {
-                    redistributeNodes(nptr, splitNode, true, parent, parentKeyIndex+1);
-                }
-            } else {
-                //System.out.println("\t -- Redistributing prev with elements from split");
-                if(splitNodeIsLeftChild) {
-                    redistributeNodes(pptr, splitNode, false, parent, parentKeyIndex-1);
-                } else {
-                    redistributeNodes(pptr, splitNode, false, parent, parentKeyIndex);
-                }
-            }
         }
         // we can't redistribute, try merging with next
         else if(npar) {