#structure #graph #tree #insertion #hybrid #bush


A Rust implementation of the Bush data structure

9 releases

0.1.8 Nov 10, 2023
0.1.7 Nov 9, 2023
0.1.1 Oct 22, 2023

#1489 in Data structures

MIT license

812 lines


Implementation of the bush data structure in Rust.

The bush data structure is an hybrid of a doubly-linked list and a tree. It allows for fast insertion and removal of elements, as well as creating 2-dimensional graphs.

The bush is basically a doubly-linked list of nodes, each of which can have a child bush. The bush is a tree, but it is not a binary tree. Each node can have any number of children.