The top documents tagged [redblack property]

Chapter 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.

---

222 views

© 2001 by Charles E. Leiserson Introduction to AlgorithmsDay 18 L10.1 Introduction to Algorithms 6.046J/18.401J/SMA5503 Lecture 10 Prof. Erik Demaine.

---

228 views

Introduction to Algorithms

---

18 views