Remove unnecessary stack in tree.get

We don't need to return an iterator in `get`, so building a stack is unnecessary. Makes `get` faster. 

Awesome library btw! I'm experimenting with balanced binary search trees in https://github.com/mourner/bbtree...