Slide 1Chapter 13. Red-Black Trees A variation of binary search trees. Balanced: height is O(lg n), where n is the number of nodes. Operations will take O(lg n) time in the…
Introduction to Algorithms Jiafen Liu Sept. 2013 Today’s Tasks Balanced Search Trees Red-black trees Height of a red-black tree Rotations Insertion Balanced Search Trees…