github.com/hslam/rbtree (go): Package rbtree implements a red–black tree.  Red–black tree properties: https://en.wikipedia.org/wiki/Red%E2%80%93black_tree  1. Each node is either red or black.  2. The root is black. This rule is sometimes omitted. Since the root can always be changed from red to black, but not necessarily vice versa, this rule has little effect on analysis.  3. All leaves (NIL) are black.  4. If a node is red, then both its children are black.  5. Every path from a given node to any of its descendant NIL nodes goes through the same number of black nodes.
Keywords: go|golang|rbtree|red-black-tree|tree