Hacker GitHub

← All repos

rtheunissen/bst

View on GitHub ↗ ★ 50 HTML

Implementing 20+ binary search trees to compare balancing strategies

3 mentions on Hacker News by 1 person: 0 stories, 3 comments · first 2023-08-16 · latest 2024-06-16

Mentions per year 3 mentions · busiest year 2023 (2)
20082026
AllStoriesComments NewestTopOldest
  1. I love the various top-down binary search tree partition/split/join algorithms. https://github.com/rtheunissen/bst/blob/main/trees%2Fbalance...
    comment by rtheunissen · 2024-06-16 · in As Lovely as a Tree
  2. …Both have value, of course. [1] https://adtinfo.org/libavl.html/BST-Node-Structure.html [2] https://github.com/rtheunissen/bst/blob/main/trees/avl_botto...
    comment by rtheunissen · 2023-08-17 · in Exploring the design space of binary search trees
  3. …can be found in [1], [2] and [3]. The logarithmic weight-balance rules are defined in [4]. [1] https://github.com/rtheunissen/bst/blob/main/trees/wbst_bott... [2] https://github.com/rtheunissen/bst/blob/main/trees/wbst_topd... [3]…
    comment by rtheunissen · 2023-08-16 · in Exploring the design space of binary search trees