import edu.princeton.cs.algs4.Point2D;
import edu.princeton.cs.algs4.RectHV;


public class PointSET {
    public PointSET() {}
    public boolean isEmpty() {}
    public int size() {}
    public void insert(Point2D p) {}
    public boolean contains(Point2D p) {}
    public void draw() {}
    public Iterable<Point2D> range(RectHV rect) {}
    public Point2D nearest(Point2D p) {}

    public static void main(String[] args) {}
}

@@ -70,16 +70,42 @@
 RectHV;%0A
+import java.util.TreeSet;%0A
 %0A%0Apublic
@@ -131,27 +131,55 @@
    p
-ublic PointSET() %7B%7D
+rivate TreeSet%3CPoint2D%3E set = new TreeSet%3C%3E();%0A
 %0A   
@@ -201,24 +201,47 @@
  isEmpty() %7B
+ return set.isEmpty(); 
 %7D%0A    public
@@ -249,24 +249,44 @@
 int size() %7B
+ return set.size(); 
 %7D%0A    public
@@ -302,32 +302,45 @@
 ert(Point2D p) %7B
+ set.add(p); 
 %7D%0A    public boo
@@ -365,16 +365,41 @@
 t2D p) %7B
+ return set.contains(p); 
 %7D%0A    pu
@@ -414,24 +414,25 @@
 d draw() %7B%7D%0A
+%0A
     public I
@@ -468,17 +468,24 @@
  rect) %7B
-%7D
+%0A%0A    %7D%0A
 %0A    pub
@@ -516,16 +516,22 @@
 t2D p) %7B
+%0A%0A    
 %7D%0A%0A    p

Write the basic implementations