Quadtree Two-dimensional binary search tree. Two-dimensional binary search tree. Each node contains a point from a two-dimensional space. Four children corresponding to 4 quadrants: NE, NW, SW, SE Unbalanced structure Insertion is simple Deletion is quite complicated   Simple re-insertion of all points is costly These are point quadtrees