WikiRNG
Rolled Roll your own

Weight-balanced tree

Self-balancing binary search tree

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 trees of bounded balance, or BB[ฮฑ] trees.

Read it on Wikipedia ยท Version rolled

RemarkableTop 9.7%
168,813SP

Badges27 earned

  1. Source CodeObscure+61,767 SP
    Has a code block.
  2. Cites a ConferenceObscure+36,193 SP
    Cites a conference paper.
  3. arXivObscure+18,885 SP
    Links to arXiv.
  4. EquationObscure+17,502 SP
    Has a math formula.
  5. ResearchGateObscure+12,178 SP
    Links to ResearchGate.
  1. FractionsNotable+5,888 SP
    Shows a fraction.
  2. Field GuideNotable+3,679 SP
    Has a Description section.
  3. Free to ReadNotable+1,731 SP
    Cites a source that is free to read.
  4. Footnote to a FootnoteNotable+1,571 SP
    Has explanatory notes. ยท 1 note
  5. The Internet ArchiveNotable+1,416 SP
    Links to the Internet Archive.
  6. C-ClassNotable+1,141 SP
    Rated C.
  7. PigeonholedNotable+1,111 SP
    In exactly one category.
Basic15
rolled by Dacuser

weight-balanced computer science