Data Structures & Algorithms Lecture Notes

8 December 2009 • Balancing Trees

---

For colored-node red-black trees, the red-black property is:

1. All leaves are black.

2. Every red node has only black children.

3. All paths from a node to its leaves contain the same number of black nodes.

---

This page last modified on 24 January 2006.