Module rudac::tree [−][src]
Structs
An AVL tree is a self-balancing binary search tree. For lookup-intensive applications, AVL trees are faster than red–black trees because they are more strictly balanced
A binomial tree of rank(order) k is a general tree with a recursive definition
An interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point.
A Red Black tree is a self-balancing binary search tree. Red Black Trees provide faster insertion and removal operations than AVL trees