red black tree for balanced binary search
I am a little confused on how to define the red and black lines(especially the red ones) in the balanced binary search tree. Besides, is there any principal related to the rotation if there exist 2 consecutive red lines in the tree? Thanks!
Topic archived. No new replies allowed.