1 views collected around this technical thread.
This article explains how MySQL InnoDB locates and deletes a specific row by describing the buffer‑pool lookup, B‑tree page traversal, page‑directory binary search, linear record scan, the compact physical record format, and the handling of signed integers and next‑record offsets, with GDB debugging examples.
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.
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.
This article explains what arrays are, how they enable O(1) random access through address calculation, the time‑complexities of insertion and deletion operations, techniques for improving array efficiency, and why zero‑based indexing is used, comparing arrays with dynamic containers like ArrayList.