Point Inserted: (r_r, 1, 20)
Point Inserted: (rec, 10, 30)
Point Inserted: (r_42, 1, 20)
Point Inserted: (far, 200, 200)
BST dump:
Node has depth 2, Value (far, 200, 200)
Node has depth 1, Value (r_42, 1, 20)
Node has depth 0, Value (r_r, 1, 20)
Node has depth 1, Value (rec, 10, 30)
BST size is: 4
QuadTree Dump:
Node at 0, 0, 1024: Internal
  Node at 0, 0, 512: Internal
    Node at 0, 0, 256: Internal
      Node at 0, 0, 128:
      (r_r, 1, 20)
      (rec, 10, 30)
      (r_42, 1, 20)
      Node at 128, 0, 128: Empty
      Node at 0, 128, 128: Empty
      Node at 128, 128, 128:
      (far, 200, 200)
    Node at 256, 0, 256: Empty
    Node at 0, 256, 256: Empty
    Node at 256, 256, 256: Empty
  Node at 512, 0, 512: Empty
  Node at 0, 512, 512: Empty
  Node at 512, 512, 512: Empty
QuadTree Size: 13 QuadTree Nodes Printed.
Duplicate Points:
(1, 20)
Point Found: (r_r, 1, 20)
Points Intersecting Region: (0, 0, 25, 25)
(r_r, 1, 20)
(r_42, 1, 20)
4 QuadTree Nodes Visited
Duplicate Points:
BST dump:
Node has depth 1, Value (far, 200, 200)
Node has depth 0, Value (r_42, 1, 20)
BST size is: 2
QuadTree Dump:
Node at 0, 0, 1024:
(far, 200, 200)
(r_42, 1, 20)
QuadTree Size: 1 QuadTree Nodes Printed.