From: Mason Freed on
After looking around, I can't find any implementations of common algorithmic data structures. In particular, I'm looking for a good binary search tree. I'd settle for any tree, but a Red-Black tree or other self-balancing architecture would be nice.

Does anyone know of an implementation of this type of thing?

Mathworks, why isn't there a data structures toolbox? (Or did I miss it??)

Thanks,
Mason