Crate ABtree[−][src]
Expand description
This crate named as ABtree but this not means it is a novel data sturcture. It’s just AVL tree and Btree For the Btree module, what makes it different from that of BtreeMap in std is this Btree can accept any number as the maximum number of inner node, as long as the number grater or equal to 3
Structs
An AVL balanced tree with owned nodes.
A b-tree with owned nodes and what makes it different from the BTreeMap in std is it choose arbitrary number as the maximum number of keys in each node, as long as the number greater or equal to 3 Note if the number has been set to 3 it becomes a 2-3 tree