functional programming: immutable data structure efficiency

Question

I don\'t understand, how FP compilers make the code dealing with immutable data structures fast, not blow up stack, etc.

For example, insert operation in tree, it ha

Answer 1

If the garbage collector is doing its job, the older copies of the data structure will be reclaimed when they're no longer being used.