Trees

Gaea has a wide variety of data structures available, binary trees, quadtrees and R-trees among them. A binary tree is a data structure, where each node has at most two children. Gaea offers an interface for AVL (Adelson-Velsky-Landis) self-balancing binary trees and red-black trees.

A quadtree is a tree data structure in which each internal node has exactly four children. The data associated with a leaf cell varies by application, but the leaf cell represents a "unit of interesting spatial information". The subdivided regions may be square or rectangular, or may have arbitrary shapes.

R-tree is a spatial access method using a tree data structure, and it is suitable for the representation of multidimensional such as geographical coordinates. Various neighbouring objects are represented by a minimum bounding rectangle, which gives "R" to the name R-tree.

If you need support for other data structures don't hesitate to ask us!