(data structure)

Definition: A tree where each node is split along all d dimensions, leading to 2d children.

Aggregate parent (I am a part of or used in ...)

See also octree, quadtree complexity theorem, linear quadtree, BSP-tree.

Note: It was originally designed for 2-dimensional data (pictures), so each node had four children, hence quadtree. After [GG98].

Author: PEB


insert (C), search (C).
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 8 June 2023.
HTML page formatted Wed Aug 9 16:21:12 2023.

Cite this as:
Paul E. Black, "quadtree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 8 June 2023. (accessed TODAY) Available from: