5.3.11  Balanced Binary Trees

• Overview
• Red-Black Trees
• Red-Black Trees: String Keys
• Red-Black Trees: Int Keys
• Red-Black Trees: Float Keys; Using the red_black_map_g Generic
• Red-Black Trees: The Map API
• Red-Black Trees: Construction Shortcuts
• Red-Black Trees: Testing on Empty
• Red-Black Trees: Listing Keys, Values and Key-Value Pairs
• Red-Black Trees: Dropping Key-Value Pairs
• Red-Black Trees: Purity Test
• Red-Black Trees: Finding First Key or Value
• Red-Black Trees: Apply
• Red-Black Trees: Map
• Red-Black Trees: Filter
• Red-Black Trees: Get
• Red-Black Trees: Folding
• Red-Black Trees: Union and Intersection
• Red-Black Trees: File Stat Example
• Red-Black Trees: Sets and the Set Api