Embark on an insightful exploration of partially and fully retroactive binary search trees (BSTs), their implementation, and performance compared to non-retroactive BSTs and simple rollback solutions. Dive into the general transformation approaches used to create retroactive BSTs, and analyze their performance under various conditions with sets of pseudo-random integers. Uncover the surprising finding that the fully retroactive implementation consistently performed slower than all other data structures, while the non-retroactive implementation emerged as the fastest.