NuRichter·Oct 15We Fed Sorted Scores to a Binary Search Tree. It Got 32× Slower.A stress test on a game leaderboard, and why the benchmark you trust most, random data, is the one most likely to lie to you.
Faith Kauwe·Mar 4The Free Lunch Wasn’t Free: An AVL Tree in the WildI decided to retrofit the “Tweet Generator” project with an AVL Tree. I was curious as to how the implementation would look and also…
Deserter·Dec 18, 2025Implementing a Red-Black TreeRed-Black tree is a widely used data structure for storing ordered data. Since Red-Black tree is a self-balancing binary search tree…
Mukailasam·Aug 29, 2025Computer Data structure: Binary Search Tree & AVL Treewhat is a Binary Search Tree and what is an AVL Tree
Alexey Usachov·Feb 9, 2025AVL TreeAVL tree is a balanced binary search tree invented by Georgy Adelson-Velsky and Evgeny Landis. The main rule is that for each node the…
Shlomi Boutnaru, Ph.D.·Jan 14, 2025The Windows Concept Journey — VAD Tree (Virtual Address Descriptor Tree)VAD Trees (Virtual Address Descriptor Trees) are used by the Windows operating system in order to describe memory ranges used by a process…A response icon1A response icon1
Fatih tuzlu·Dec 26, 2024Let’s try to understand the AVL Tree Balance Factor in Binary treeWhat is AVL TreeA response icon1A response icon1
Zartaj Nadeem·Nov 29, 2024Exploring the Balance Factor in AVL TreesIn data structures and algorithms, AVL trees are a type of binary search tree (BST) designed to stay balanced. This balance ensures that…A response icon6A response icon6
Zartaj Nadeem·Nov 28, 2024AVL Tree: A Balancing Act in Data StructuresAn AVL tree is a special kind of binary search tree that keeps itself balanced to ensure faster and more efficient operations. Introduced…A response icon10A response icon10
