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.

AlgorithmsBinary Search TreeData Structures

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.

AlgorithmsBinary Search TreeNginx

0 likes · 16 min read

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