I've recently implemented RB tree, B-Tree and vEB tree. I was wondering however if there's any rule of thumb for testing if my implementation are actually correct.
Is there any reference that can tell how to develop proper test cases for such data structures?
Besides from mathematical techniques maybe.
What about graph in general?