Add leftist heap implementation.

theodesp / go-heaps

Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci

MIT License

96 stars 29 forks source link

Closed Syfaro closed 5 years ago

Syfaro commented 5 years ago

Resolves #7 by adding a Leftist heap. I believe I followed the references correctly, and the tests I wrote do pass.

theodesp commented 5 years ago

Ta!