Ramkumar Ramachandra wrote: > Treaps provide a memory-efficient binary search tree structure. > Insertion/deletion/search are about as about as fast in the average > case as red-black trees and the chances of worst-case behavior are > vanishingly small, thanks to (pseudo-)randomness. The bad worst-case > behavior is a small price to pay, given that treaps are much simpler > to implement. I still haven’t checked this implementation in detail, but it seemed to work in practice and is about to change anyway. I like the documentation updates. What else changed from the previous round? -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html