[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Self balancing trees
From: |
Nala Ginrut |
Subject: |
Re: Self balancing trees |
Date: |
Wed, 23 Aug 2017 12:00:11 +0800 |
Here's mine, but I haven't updated for a while, RB tree works, please don't
use it seriously, and hope it inspire you.
https://github.com/NalaGinrut/nashkel/blob/master/nashkel/rbtree.scm
2017年8月22日 下午5:34,"Kovacsics Róbert" <address@hidden>写道:
> Sorry Marko, I didn't hit reply all, so re-sending for the benefit of the
> list.
>
> I'd just like to point out
> https://wiki.rice.edu/confluence/download/attachments/2761212/Okasaki-
> Red-Black.pdf
> for the simplicity of it's Red-Black tree implementation. Granted, it
> uses Haskell, but you could implement it similarly simply as Guile has
> pattern-matching too with (ice-9 match). Also, it hasn't got a delete
> operation, that would be more messy.
>
>