Alexander Milevski

I know)) Any suggestions are welcome. Also check out [w8r/martinez](https://github.com/w8r/martinez)

First of all - great library, superb performance! We can do it using ES2015 + some type checks. Anyway, not to offend anyone, the `C#` code style is very confusing...

I do agree that this is not obvious. But I guess the returned nodes in the tree with duplicates are not exactly random, they just depend on the traversal direction...

btw would you care to help with that? can be rewritten with a stack, I believe

I tried similar idea with a stack on another tree, it's actually not a tiny bit faster.

Please do! Would that still be es5 compatible?

That would be cool!

3. tree[Symbol.iterator] returns an entries ([key, value]) iterable? --- 1. `tree.keys()` stays an array, as before, add `tree.keysIterable()` right?

yes, let's do it like that. Maybe I will change the API later. I will also add your changes to the `splay-tree` repo then

Thanks a lot! Let me take a look at the `findParent` to understand it better, and run the benchmarks