Neo & Byte · #4 · AVL vs red-black trees
An AVL tree keeps the heights of every node's two subtrees within one of each other, so it stays lower and lookups are slightly faster. A red-black tree only promises that no path from the root is more than twice as long as another, so it can be taller, but it repairs itself more cheaply: a deletion needs at most three rotations, where an AVL deletion can need one at every level. Both search, insert and delete in O(log n).
In the VisiGrab app, build AVL and red-black trees yourself and watch every insert and delete, rotation by rotation. App Store · Google Play