KnowledgeBase » SEMINAR
» ID = 619
Red-black trees is a data structure of balanced binary trees.
I'll show how it could be implemented and verified in MetaPRL.
PRL Project |
Computer Science Department |
320 Gates Hall, Ithaca, NY 14853 | © 2014 Cornell University
| Prof Constable's Library
| PRL SourceForge Project Page