{"component":{"type":17,"accent_color":10980315,"components":[{"type":10,"content":"-# WikiRNG · Roll of 10/22/2026 · by [Dacuser](https://wikirng.com/u/Dacuser)"},{"type":10,"content":"## [Weight-balanced tree](https://wikirng.com/roll/dm8xT09Xvk)\n*Self-balancing binary search tree*"},{"type":10,"content":">>> In computer science, weight-balanced binary trees (WBTs) are a type of self-balancing binary search trees that can be used to implement dynamic sets, dictionaries (maps) and sequences. These trees were introduced by Nievergelt and Reingold in the 1970s as…"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### 🟪 Remarkable · 168,813 SP\n-# Top 9.7%"},{"type":10,"content":"*weight-balanced computer science*"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 ⌨️ **Source Code** · Obscure · +61,767 SP\n-# Has a code block.\n🟦 🎤 **Cites a Conference** · Obscure · +36,193 SP\n-# Cites a conference paper.\n🟦 🧪 **arXiv** · Obscure · +18,885 SP\n-# Links to arXiv.\n🟦 🧮 **Equation** · Obscure · +17,502 SP\n-# Has a math formula.\n🟦 🧫 **ResearchGate** · Obscure · +12,178 SP\n-# Links to ResearchGate.\n🟩 ➗ **Fractions** · Notable · +5,888 SP\n-# Shows a fraction.\n-# +21 more badges"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/dm8xT09Xvk"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Weight-balanced_tree"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}