etcd/adt at bc9e433ca26be0314a37c8c6ead66429a584bbc9 - etcd

History

Piotr Tabor de55bb6331 pkg: Rename imports after making 'pkg' a module find -name '*.go' \| xargs sed --follow-symlinks -i 's\|go.etcd.io/etcd/v3/pkg/\|go.etcd.io/etcd/pkg/v3/\|g' go fmt ./...		2020-10-13 00:09:27 +02:00
..
img	pkg/adt: README "IntervalTree.Delete" test case images	2019-07-31 10:05:32 -07:00
README.md	pkg: Rename imports after making 'pkg' a module	2020-10-13 00:09:27 +02:00
adt.go	package adt: rename the filename to be consistent with the package name (#12170 )	2020-07-28 14:40:34 -07:00
example_test.go	pkg: Rename imports after making 'pkg' a module	2020-10-13 00:09:27 +02:00
interval_tree.go	pkg/adt: rbcolor string fix	2019-12-30 19:52:34 +08:00
interval_tree_test.go	pkg/adt: remove TODO	2019-08-05 00:24:39 -07:00

README.md

Red-Black Tree

"Introduction to Algorithms" (Cormen et al, 3rd ed.), Chapter 13

Every node is either red or black.
The root is black.
Every leaf (NIL) is black.
If a node is red, then both its children are black.
For each node, all simple paths from the node to descendant leaves contain the same number of black nodes.

For example,

import (
    "fmt"

    "go.etcd.io/etcd/pkg/v3/adt"
)

func main() {
    ivt := adt.NewIntervalTree()
    ivt.Insert(NewInt64Interval(510, 511), 0)
    ivt.Insert(NewInt64Interval(82, 83), 0)
    ivt.Insert(NewInt64Interval(830, 831), 0)
    ...

After inserting the values 510, 82, 830, 11, 383, 647, 899, 261, 410, 514, 815, 888, 972, 238, 292, 953.

Deleting the node 514 should not trigger any rebalancing:

Deleting the node 11 triggers multiple rotates for rebalancing:

Try yourself at https://www.cs.usfca.edu/~galles/visualization/RedBlack.html.