Added QuadTree to repo

git-svn-id: https://java-algorithms-implementation.googlecode.com/svn/trunk@387 032fbc0f-8cab-eb90-e552-f08422b9a96a

Author: phishman3579

src/com/jwetherell/algorithms/data_structures/QuadTree.java

@@ -255,17 +255,17 @@ public String toString() {
             StringBuilder builder = new StringBuilder();
             builder.append("(");
             builder.append(upperLeft.toString()).append(", ");
-            builder.append("height").append(" = ").append(height).append(", ");
-            builder.append("width").append(" = ").append(width);
+            builder.append("height").append("=").append(height).append(", ");
+            builder.append("width").append("=").append(width);
             builder.append(")");
             return builder.toString();
         }
     }
 
     public static class XYPoint implements Comparable<XYPoint> {
 
-        private double x = Double.NEGATIVE_INFINITY;
-        private double y = Double.NEGATIVE_INFINITY;
+        public double x = Double.NEGATIVE_INFINITY;
+        public double y = Double.NEGATIVE_INFINITY;
 
         public XYPoint(double x, double y) {
             this.x = x;
@@ -352,7 +352,7 @@ public static <T extends XYPoint> String getString(QuadTree<T> tree) {
         private static <T extends Comparable<T>> String getString(QuadNode node, String prefix, boolean isTail) {
             StringBuilder builder = new StringBuilder();
 
-            builder.append(prefix + (isTail ? "└── " : "├── ") + " node=" + node.toString() + "\n");
+            builder.append(prefix + (isTail ? "└── " : "├── ") + " node={" + node.toString() + "}\n");
             List<QuadNode> children = null;
             if (node.northWest != null || node.northEast != null || node.southWest != null || node.southEast != null) {
                 children = new ArrayList<QuadNode>(4);