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:
Regards,
Mike