Method range

05Lab-Kd Tree/KdTree.java:102–107

(RectHV rect)

    // all points that are inside the rectangle (or on the boundary)
    public Iterable<Point2D> range(RectHV rect) {
        if (rect == null) throw new IllegalArgumentException();
        ArrayList<Point2D> arrayList = new ArrayList<>();
        if (!isEmpty()) range(root, rect, arrayList);
        return arrayList;
    }

    private void range(Node nd, RectHV rect, ArrayList<Point2D> arrayList) {
        if (rect.contains(nd.p)) arrayList.add(nd.p);