Found a small bug in KdTree

Justin Wetherell · Justin Wetherell · commit 303acb71d8fd · 2016-12-30T12:45:48.000-05:00
diff --git a/src/com/jwetherell/algorithms/data_structures/KdTree.java b/src/com/jwetherell/algorithms/data_structures/KdTree.java
@@ -149,12 +149,12 @@ else if (axis == Y_AXIS)
                 }
             }
 
-            if ((medianIndex - 1) >= 0 && less.size() > 0) {
+            if ((medianIndex-1 >= 0) && less.size() > 0) {
                 node.lesser = createNode(less, k, depth + 1);
                 node.lesser.parent = node;
             }
 
-            if ((medianIndex + 1) <= (list.size() - 1) && more.size() > 0) {
+            if ((medianIndex <= list.size()-1) && more.size() > 0) {
                 node.greater = createNode(more, k, depth + 1);
                 node.greater.parent = node;
             }

Original file line number	Diff line number	Diff line change
`@@ -149,12 +149,12 @@ else if (axis == Y_AXIS)`
`149`	`149`	`}`
`150`	`150`	`}`
`151`	`151`
`152`		`- if ((medianIndex - 1) >= 0 && less.size() > 0) {`
	`152`	`+ if ((medianIndex-1 >= 0) && less.size() > 0) {`
`153`	`153`	`node.lesser = createNode(less, k, depth + 1);`
`154`	`154`	`node.lesser.parent = node;`
`155`	`155`	`}`
`156`	`156`
`157`		`- if ((medianIndex + 1) <= (list.size() - 1) && more.size() > 0) {`
	`157`	`+ if ((medianIndex <= list.size()-1) && more.size() > 0) {`
`158`	`158`	`node.greater = createNode(more, k, depth + 1);`
`159`	`159`	`node.greater.parent = node;`
`160`	`160`	`}`