A popular form of these was invented by Rudolf Bayer and is often used for implementing databases; this is the B variety.
Path finding problems containing differential constraints and obstacles can be solved efficiently with the rapidly-exploring random type of these data structures. Two-dimensional problems can be solved with the polygonal map or point region flavors of a certain type of these objects, while Arne Andersson lends his initials to a type of these that are similar to the 2-3 ["two three"] type. Another type of these can perform insert and delete operations in big O of n log n time by enforcing rules on the color of nodes. A popular form of these was invented by Rudolf Bayer and is often used for implementing databases; this is the B variety. Self-balancing forms of a particular type of these data structures are exemplified in the AVL and red-black types. For 10 points, name this data structure which also comes in a binary search type.
Path finding problems containing differential constraints and obstacles can be solved efficiently with the rapidly-exploring random type of these data structures.
{tree} [accept {Quadtree} before "{2}-{3}"]