I am a student at University of New Mexico. For the final term project for my CS361 (CS 361 -- Data Structures and Algorithms I) I have to compare a data Structure(hash, heap, bst, 2-3 tree...etc) against MY AVL tree in performance, element comparison...etc.
I chose RB tree, but I am having a hard time finding a well written (commented) RB tree implementation for C++. If anyone would help that'll be great.
here is the link for it, as it stated, I am not turning in the RB tree program I found on the web as the assignment, I am simply wanting to get RB tree implementation so I can do experiement (comparisons) with the AVL tree I created.
If anyone have link or wrote a working RB tree in C++ please, help or send me the files at email@example.com
and the hat of int overfl
Link Doesn't Work :(
I think I tried that the link doesn't work.
I also found Weiss' implementation which is well commented, but he has not finished the Remove_node(i) function, I could compare only insert but that won't be as interesting as comparing to both Insert, Revmoe and Propagation count.