Tagged articles

Self-Balancing Tree

3 articles · Page 1 of 1

Sep 5, 2026 · Fundamentals

Red-Black Trees: Why 'Lazy but Strong' Beats Perfect Balance in Engineering

This tutorial explains Red-Black Trees, comparing them with AVL trees, detailing their five properties, three fix operations (recolor, left/right rotations), providing a Python implementation, and covering real-world uses in Java HashMap, Linux kernel, and databases, plus selection guidelines and common pitfalls.

AVL TreeData StructuresHashMap

0 likes · 10 min read

Red-Black Trees: Why 'Lazy but Strong' Beats Perfect Balance in Engineering

Java Captain

Aug 27, 2019 · Fundamentals

Understanding Red-Black Trees: Concepts, Operations, and Insertion Examples

This article explains the fundamentals of red‑black trees, a self‑balancing binary search tree, covering their properties, recolor and rotation operations, step‑by‑step insertion cases, and practical questions such as Java 8 HashMap usage and deletion rules.

AlgorithmsData StructuresRed-Black Tree

0 likes · 8 min read

Understanding Red-Black Trees: Concepts, Operations, and Insertion Examples

Xueersi Online School Tech Team

Jul 5, 2019 · Fundamentals

Understanding ngx_rbtree_t Red‑Black Tree in Nginx: Theory, Properties, and Implementation

This article explains the fundamentals of the ngx_rbtree_t red‑black tree used in Nginx, covering its origin from 2‑3 trees, core properties, insertion and deletion algorithms, rotation and recoloring operations, and provides source‑code analysis with illustrative diagrams.

AlgorithmsNginxRed-Black Tree

0 likes · 16 min read

Understanding ngx_rbtree_t Red‑Black Tree in Nginx: Theory, Properties, and Implementation