Tagged articles
binary search tree
20 articles · Page 1 of 1

liandkSep 4, 2026 · Fundamentals
This article explains AVL balanced binary trees, covering the balance factor, four rotation types (LL, RR, LR, RL), a complete Python implementation with height updates, real-world use cases, and a comparison showing AVL's guaranteed O(log n) query performance versus BST's degradation to O(n).
AVL TreeAlgorithmInterview Preparation
0 likes · 8 min read


liandkSep 2, 2026 · Fundamentals
This article explains binary search trees (BST), detailing their left‑small right‑large ordering rule, core properties, and why they outperform ordinary binary trees with O(log n) search, while covering insertion, search, deletion, in‑order traversal code in Python, common pitfalls, and real‑world use cases.
AlgorithmsBSTInterview Prep
0 likes · 8 min read

This article introduces the binary search tree (BST) data structure, explains its core concepts, provides Python implementations for node definition, search, insert, and delete operations, compares performance, and discusses practical applications and exercises.
AlgorithmsBSTDELETE
0 likes · 7 min read

This article explains the treap data structure, detailing how each node stores a key and a priority to satisfy both binary‑search‑tree ordering and heap ordering, and walks through insertion, rotation, deletion, and a full Python implementation with concrete examples.
HeapPythonTreap
0 likes · 14 min read

This article explains the concept of AVL self‑balancing binary search trees, outlines their height‑balancing property, and provides step‑by‑step Java code examples defining a Node class implementing Comparable and an AVLTree class with height, balance factor calculations, and rotation methods for insertion and deletion.
AVL TreeJavabinary search tree
0 likes · 4 min read

This article explains how database indexes work by first reviewing binary search trees, then introducing N‑ary trees and B+ trees, illustrating their structure, storage calculations, and search process in InnoDB to show why B+ trees are used for efficient indexing.
B+TreeInnoDBN-ary Tree
0 likes · 7 min read

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.
AlgorithmsBalanced TreesRed-Black Tree
0 likes · 12 min read

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.
AlgorithmsRed-Black Treebalanced tree
0 likes · 12 min read

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.
AlgorithmsIllustrated TutorialRed-Black Tree
0 likes · 5 min read

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 red‑black trees, illustrating how they maintain balance, avoid degeneration, and are applied in modern software systems.
AVL TreeB-treeRed-Black Tree
0 likes · 10 min read

This article introduces the concept of trees and binary search trees, defines a C struct for tree nodes, and provides complete implementations for creating nodes, inserting, deleting, searching, finding min/max, computing size and height, as well as recursive and non‑recursive traversals including pre‑order, in‑order, post‑order and level‑order.
AlgorithmC++binary search tree
0 likes · 13 min read


政采云技术Dec 22, 2019 · Fundamentals
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.
AlgorithmsInsertionRed-Black Tree
0 likes · 19 min read

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.
AlgorithmsRed-Black TreeSelf-Balancing Tree
0 likes · 8 min read

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.
AlgorithmBalancingRed-Black Tree
0 likes · 10 min read

This article explains the balanced binary search tree known as a red‑black tree, detailing its five defining properties, illustrating insertion examples that maintain balance, and describing left and right rotation operations with visual aids to help readers grasp the underlying algorithms.
AlgorithmsRed-Black TreeTree Rotations
0 likes · 4 min read

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.
AlgorithmsRed-Black TreeSelf-Balancing Tree
0 likes · 16 min read


ITPUBApr 3, 2018 · Fundamentals
Binary Search Trees (BST) are dynamic, ordered binary trees that enable fast search, insertion, and deletion; this guide explains their definition, properties, traversal methods, and core operations—including search, minimum/maximum, successor/predecessor, insertion, and deletion—complete with pseudocode and illustrative examples.
Algorithmsbinary search treedata structures
0 likes · 17 min read


ITPUBMar 24, 2017 · Fundamentals
Binary Search Trees (BST) are ordered binary trees that enable fast search, insertion, and deletion of nodes; this guide explains their definition, properties, traversal methods, and core operations—including search, minimum/maximum, successor/predecessor, insertion, and deletion—complete with pseudocode and illustrative examples.
binary search treedata-structuresinsertion-deletion
0 likes · 16 min read


ITPUBMar 24, 2017 · Fundamentals
Binary Search Trees (BST) are ordered binary trees that enable fast search, insertion, and deletion of nodes; this guide explains their definition, key properties, traversal methods, and core algorithms—including search, minimum/maximum, successor/predecessor, insertion, and deletion—with pseudocode and illustrative examples.
Insertionbinary search treedata-structures
0 likes · 16 min read

This article explains binary search trees, their limitations, and introduces red‑black trees as a balanced BST alternative, detailing their properties, node definitions, rotation mechanisms, and step‑by‑step insertion and deletion algorithms with Java code examples and visual illustrations.
AlgorithmsJavaRed-Black Tree
0 likes · 19 min read
