BestHub
Sign in
Tagged articles

Red-Black Tree

42 articles · Page 1 of 1
LuTiao Programming
LuTiao Programming
May 6, 2026 · Fundamentals

HashMap Deep Dive: How Hash Collisions Are Resolved and When Lists Turn into Red‑Black Trees

HashMap is not a simple key‑value store but an array‑based scheduling system that uses a three‑step put process, hash perturbation, bit‑wise indexing, and conditional conversion of long bucket lists into red‑black trees, with resize mechanics that can become performance bottlenecks in high‑concurrency Java applications.

Data StructuresHashMapJava
0 likes · 8 min read
HashMap Deep Dive: How Hash Collisions Are Resolved and When Lists Turn into Red‑Black Trees
Deepin Linux
Deepin Linux
Nov 27, 2025 · Backend Development

How epoll Scales to Millions of Connections Using Red‑Black Trees and Ready Lists

This article explains the inner workings of Linux's epoll mechanism, detailing how red‑black trees manage registered file descriptors and how a ready‑list delivers events in O(1) time, covering core APIs, data structures, insertion‑deletion logic, and the full kernel‑space to user‑space flow.

LinuxNetwork ProgrammingRed-Black Tree
0 likes · 54 min read
How epoll Scales to Millions of Connections Using Red‑Black Trees and Ready Lists
NiuNiu MaTe
NiuNiu MaTe
Sep 1, 2025 · Backend Development

How Does Java’s HashMap Resolve Hash Collisions? From Linked Lists to Red‑Black Trees

Java’s HashMap tackles hash collisions through a combination of perturbation functions, chaining, open addressing, and, since JDK 8, converting long chains into red‑black trees, with detailed explanations of the underlying algorithms, resizing mechanics, threshold choices, and performance trade‑offs for developers and interview candidates.

HashMapJavaRed-Black Tree
0 likes · 17 min read
How Does Java’s HashMap Resolve Hash Collisions? From Linked Lists to Red‑Black Trees
Cognitive Technology Team
Cognitive Technology Team
Aug 25, 2025 · Backend Development

Why epoll Uses Red-Black Trees for High-Performance Linux Networking

epoll, Linux’s high-performance I/O multiplexing mechanism, outperforms select and poll by leveraging a red-black tree to manage file descriptors, offering O(log n) registration, O(1) event retrieval, and scalable handling of millions of connections, with detailed explanations of its architecture, workflow, and performance advantages.

I/O multiplexingLinuxRed-Black Tree
0 likes · 10 min read
Why epoll Uses Red-Black Trees for High-Performance Linux Networking
Deepin Linux
Deepin Linux
May 17, 2024 · Fundamentals

Comprehensive Overview of epoll Data Structures and Implementation in Linux

This article systematically explains epoll's core data structures—including a red‑black tree and a doubly linked ready list—its three main APIs, the kernel implementation details, thread‑safety mechanisms, ET vs. LT behavior, and how it improves over select/poll for high‑concurrency network programming.

I/O multiplexingLinux kernelRed-Black Tree
0 likes · 68 min read
Comprehensive Overview of epoll Data Structures and Implementation in Linux
JD Cloud Developers
JD Cloud Developers
Jan 11, 2024 · Fundamentals

Why Red-Black Trees Beat AVL: Insertion, Deletion, and Java TreeMap

This article explores the classic implementation of red‑black trees, comparing them with AVL trees, detailing their 2‑3‑4 tree correspondence, and walking through Java TreeMap insertion and deletion algorithms, including node definitions, rotation cases, and rebalancing procedures, while analyzing their time complexities.

AVL treeData StructuresJava TreeMap
0 likes · 20 min read
Why Red-Black Trees Beat AVL: Insertion, Deletion, and Java TreeMap
Sohu Tech Products
Sohu Tech Products
Oct 7, 2022 · Fundamentals

Understanding the Underlying Principles of Java HashMap

This article explains how Java's HashMap stores key‑value pairs using an array‑plus‑linked‑list structure, details the hash function, index calculation, collision handling, resizing, and the conditions under which linked lists are replaced by red‑black trees, illustrated with concrete code examples.

CollisionHashMapRed-Black Tree
0 likes · 20 min read
Understanding the Underlying Principles of Java HashMap
Java Captain
Java Captain
Mar 13, 2022 · Fundamentals

Understanding the Underlying Data Structure and Mechanics of Java HashMap

This article explains Java HashMap's internal structure, including the array‑linked list and red‑black tree design, load factor, collision resolution methods, resizing process, key selection, thread‑safety concerns, and the hash calculation algorithm, providing detailed insights for developers.

Data StructureHashMapJDK
0 likes · 17 min read
Understanding the Underlying Data Structure and Mechanics of Java HashMap
JD Tech
JD Tech
Mar 8, 2022 · Fundamentals

Fundamentals of Data Structures and Algorithms

This article provides a comprehensive overview of fundamental data structures and algorithms, covering basic concepts, complexity analysis, case studies, and detailed examinations of structures such as HashMap, Bloom filter, SkipList, AVL, Red‑Black, B+Tree, and HashTree, while discussing their advantages, disadvantages, and typical use cases.

AVL treeData StructuresHashMap
0 likes · 23 min read
Fundamentals of Data Structures and Algorithms
Ops Development Stories
Ops Development Stories
Oct 12, 2021 · Databases

Mastering Database Indexes: From Binary Trees to B+Trees and Beyond

This article explains the fundamentals and structures of database indexes—including binary trees, red‑black trees, B‑Tree, B+Tree, hash indexes—and details how MySQL’s InnoDB and MyISAM engines implement clustered and non‑clustered indexes, covering their characteristics, storage files, and query behavior.

B+TreeDatabase IndexesHash Index
0 likes · 9 min read
Mastering Database Indexes: From Binary Trees to B+Trees and Beyond
Programmer DD
Programmer DD
May 24, 2021 · Fundamentals

Master Red‑Black Trees: From 2‑3‑4 Trees to Practical Implementation

This article walks through the fundamentals of red‑black trees, explains their equivalence to 2‑3‑4 trees, details insertion and deletion rules, compares their performance to plain binary search trees, and shares practical debugging tips for implementing a balanced tree in code.

2-3-4 TreeData StructuresRed-Black Tree
0 likes · 12 min read
Master Red‑Black Trees: From 2‑3‑4 Trees to Practical Implementation
Full-Stack Internet Architecture
Full-Stack Internet Architecture
May 13, 2021 · Fundamentals

Understanding Trees, Binary Trees, AVL Trees, and Red-Black Trees: Concepts, Properties, and Operations

This article explains the fundamentals of tree data structures—including general trees, binary trees, AVL balanced trees, and red‑black trees—covering their definitions, node types, properties, rotation techniques, and insertion and deletion algorithms with illustrative code examples.

Data StructuresRed-Black Treealgorithms
0 likes · 17 min read
Understanding Trees, Binary Trees, AVL Trees, and Red-Black Trees: Concepts, Properties, and Operations
Top Architect
Top Architect
Mar 22, 2021 · Fundamentals

Understanding Red‑Black Trees and Related Balanced Tree Structures

This article explains the concepts, properties, and operations of binary trees, binary search trees, AVL trees, 2‑3 and 2‑3‑4 trees, B‑trees, and especially red‑black trees, illustrating how they maintain balance through rotations and why they are widely used in ordered data storage.

Balanced TreesBinary Search TreeData Structures
0 likes · 12 min read
Understanding Red‑Black Trees and Related Balanced Tree Structures
Code Ape Tech Column
Code Ape Tech Column
Mar 16, 2021 · Fundamentals

Understanding Red-Black Trees and Related Balanced Binary Search Trees

This article introduces binary trees, binary search trees, and various self‑balancing trees such as AVL, 2‑3, 2‑3‑4, B‑trees, and explains the structure, properties, rotations, and common applications of red‑black trees in a clear, illustrated manner.

Binary Search TreeData StructuresRed-Black Tree
0 likes · 12 min read
Understanding Red-Black Trees and Related Balanced Binary Search Trees
Liangxu Linux
Liangxu Linux
Mar 14, 2021 · Fundamentals

Master Red-Black Trees with Illustrated Comics: From Basics to Insertion & Deletion

An illustrated guide walks readers through the fundamentals of red‑black trees, explaining binary search tree basics, their limitations, and the red‑black tree’s balancing operations—including node rotations, insertion, and deletion cases—while providing complete source code tested with massive random operations.

Binary Search TreeComputer ScienceData Structures
0 likes · 5 min read
Master Red-Black Trees with Illustrated Comics: From Basics to Insertion & Deletion
Su San Talks Tech
Su San Talks Tech
Dec 8, 2020 · Backend Development

How Java's ConcurrentHashMap Delivers High‑Performance Thread Safety

This article explains the internal design of Java's ConcurrentHashMap, covering its evolution from JDK7 to JDK8, the segment‑based locking mechanism, lock‑free reads, CAS operations, table resizing, treeification, and the key classes and methods that enable efficient concurrent access while maintaining thread safety.

CASLock SplittingRed-Black Tree
0 likes · 42 min read
How Java's ConcurrentHashMap Delivers High‑Performance Thread Safety
Selected Java Interview Questions
Selected Java Interview Questions
Jul 28, 2020 · Fundamentals

Understanding Java HashMap: Structure, Operations, and Internals

This article explains the internal structure and behavior of Java's HashMap, covering its node and tree node classes, default parameters, hash calculation, resizing mechanism, and the conditions under which linked lists are transformed into red‑black trees, along with code examples and performance considerations.

Data StructureHashMapJava
0 likes · 22 min read
Understanding Java HashMap: Structure, Operations, and Internals
Sohu Tech Products
Sohu Tech Products
May 20, 2020 · Fundamentals

Understanding Red‑Black Tree Insertion Cases and Rotations

This article provides a comprehensive tutorial on red‑black trees, covering binary search tree fundamentals, the five classic insertion cases, recoloring rules, left and right rotations, and a step‑by‑step example of inserting a new node while preserving all red‑black properties.

Data StructuresInsertionRed-Black Tree
0 likes · 8 min read
Understanding Red‑Black Tree Insertion Cases and Rotations
Full-Stack Internet Architecture
Full-Stack Internet Architecture
May 15, 2020 · Fundamentals

Understanding Red-Black Tree Insertion Operations

This article provides a comprehensive, step‑by‑step explanation of red‑black tree insertion, covering binary search tree basics, red‑black properties, the five insertion cases, color changes, left and right rotations, and detailed visual examples to help readers fully master the data structure.

BalancingData StructuresInsertion
0 likes · 8 min read
Understanding Red-Black Tree Insertion Operations
政采云技术
政采云技术
Apr 6, 2020 · Fundamentals

Red-Black Tree Deletion Explained (Part 2)

This article provides a comprehensive, step‑by‑step explanation of red‑black tree deletion, covering node search, replacement strategies, nine deletion cases with detailed rotations and recoloring, accompanying JavaScript code, and real‑world applications in Java, Nginx, and Linux kernels.

Data StructuresDeletionRed-Black Tree
0 likes · 20 min read
Red-Black Tree Deletion Explained (Part 2)
Liangxu Linux
Liangxu Linux
Dec 24, 2019 · Fundamentals

Master Red-Black Trees: Definitions, Properties, and Insertion/Deletion Walkthrough

This article provides a comprehensive, image‑rich tutorial on red‑black trees, covering their definition, five core properties, node naming conventions, rotation and recoloring operations, detailed search algorithms, step‑by‑step insertion and deletion cases with visual illustrations, and answers to thought‑provoking exercises.

Data StructuresDeletionInsertion
0 likes · 25 min read
Master Red-Black Trees: Definitions, Properties, and Insertion/Deletion Walkthrough
政采云技术
政采云技术
Dec 22, 2019 · Fundamentals

A Beginner-Friendly Illustrated Guide to Red-Black Trees (Part 1)

This article provides a clear, illustrated introduction to red‑black trees, covering their definition, fundamental properties, binary search tree background, traversal methods, rotation and recoloring techniques, and detailed insertion scenarios with JavaScript code examples, preparing readers for further study of deletions.

Binary Search TreeData StructuresInsertion
0 likes · 19 min read
A Beginner-Friendly Illustrated Guide to Red-Black Trees (Part 1)
Architecture Digest
Architecture Digest
Dec 18, 2019 · Fundamentals

Understanding Red‑Black Trees: Principles, Insertion, Deletion, Rotations and Java TreeMap Implementation

This article provides a comprehensive overview of red‑black trees, covering the underlying concepts of binary trees, binary search trees, balanced trees such as AVL, the five red‑black properties, insertion and deletion algorithms with color changes and rotations, and a detailed Java TreeMap source‑code illustration.

BalancingData StructuresDeletion
0 likes · 23 min read
Understanding Red‑Black Trees: Principles, Insertion, Deletion, Rotations and Java TreeMap Implementation
Full-Stack Internet Architecture
Full-Stack Internet Architecture
Oct 20, 2019 · Fundamentals

Understanding the Differences Between TreeSet, HashSet, HashMap, TreeMap, and Red-Black Trees in Java

An interview-style dialogue explains the distinctions between TreeSet and HashSet, the underlying implementations of HashMap versus TreeMap, and how red‑black trees provide balanced performance, covering hash collisions, treeification, and thread‑safety considerations in Java collections.

CollectionsData StructuresHashMap
0 likes · 6 min read
Understanding the Differences Between TreeSet, HashSet, HashMap, TreeMap, and Red-Black Trees in Java
Java Captain
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.

Binary Search TreeData StructuresRed-Black Tree
0 likes · 8 min read
Understanding Red-Black Trees: Concepts, Operations, and Insertion Examples
Programmer DD
Programmer DD
Jul 27, 2019 · Fundamentals

Master Red-Black Trees: Visual Guide to Balancing Binary Search Trees

This article offers a clear, visual introduction to red‑black trees, covering binary search tree fundamentals, the four balancing rules, insertion cases with recolor and rotation steps, and step‑by‑step animated examples, helping readers grasp and remember the concepts through images and analogies.

BalancingBinary Search TreeData Structures
0 likes · 10 min read
Master Red-Black Trees: Visual Guide to Balancing Binary Search Trees
Programmer DD
Programmer DD
Jul 26, 2018 · Backend Development

How Does ConcurrentHashMap Turn Buckets into Red‑Black Trees?

This article explains the internal mechanics of Java's ConcurrentHashMap when a bucket’s linked list exceeds the TREEIFY_THRESHOLD, detailing how the structure is converted into a red‑black tree, the treeifyBin implementation, node insertion cases, rotation operations, and the supporting helper methods.

JUCRed-Black Treedata-structures
0 likes · 15 min read
How Does ConcurrentHashMap Turn Buckets into Red‑Black Trees?
Tencent Database Technology
Tencent Database Technology
Nov 23, 2017 · Fundamentals

Augmenting Red‑Black Trees with a Count Field for Order‑Statistic (Rank) Queries

This article explains how to extend a red‑black tree with a subtree‑size counter to support O(log n) rank and selection operations, detailing the required count updates during insertion, deletion, and tree rotations, and provides complete pseudocode for left/right rotations, rank queries, and element‑by‑rank retrieval.

Red-Black Treealgorithmaugmented data structure
0 likes · 6 min read
Augmenting Red‑Black Trees with a Count Field for Order‑Statistic (Rank) Queries