One of the first things I wrote in Go (in 2010) was a height-balanced binary tree. I was trying to use a number of Go's features to learn.
Recently I converted this project to use generics. I tried not to deviate from the original design too much, so that they could be compared. (That said, I'm sure my design could be improved a lot, and I'll do that when generics are released.) If anyone wants to do a comparison, you can look at: https://github.com/ancientlore/go-avltree (original version) https://github.com/ancientlore/go-avltree/tree/v2 (generics version) Regards, Mike -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/golang-nuts/9e317699-6272-4fdf-b514-67dfc2f1a00en%40googlegroups.com.
