Meetings With Remarkable Trees
Please log in to watch this conference skillscast.
All of these have shortcomings. Hickey tries are magically indexable but the only other thing you can do to them is add things to the end. Finger trees are absurdly flexible but you can’t index them efficiently. And so the search goes on…
And today, you’re going to learn about the ultimate list data structure: the RRB tree ('relaxed radix balanced tree'). It is an improved version of the tried-and-tested Hickey trie and has achieved the impossible: every basic operation is efficient - push and pop on either end, index lookup, split and join. RRB trees pull no punches.
Watch as Bodil shares diagrams with brightly coloured boxes in an enthusiastic effort to explain why RRB trees are amazingly exciting.
YOU MAY ALSO LIKE:
Thank you to our sponsors and partners
Platinum
Gold
Silver
Bronze
Partners
Meetings With Remarkable Trees
Bodil Stokke
Bodil works as a computer science researcher for a secretive think tank, and is a world renowned expert in varied fields such as pizza and persistent data structures. Contrary to popular rumour, she only has five fingers on each hand, but is still an Emacs user.