Skip to main content
PRL Project

Verified Implementation of Red-Black Trees

by Alexei Kopylov
2003-2004

Red-black trees is a data structure of balanced binary trees. I'll show how it could be implemented and verified in MetaPRL.
Slides