Thursday Extra: "Left-leaning red-black trees"

On Thursday, February 13, John Stone will describe left-leaning red-black trees, a variant of binary search trees that guarantees that the worst-case running times for search, insertion, and deletion are proportional to the logarithm of the number of elements in the tree, and is easier to understand and simpler to code than more familiar self-balancing tree structures.

Refreshments will be served at 4:15 p.m. in the Computer Science Commons (Noyce 3817). The talk, “Left-leaning red-black trees,” will follow at 4:30 p.m. in Noyce 3821. Everyone is welcome to attend!
Syndicate content