Can you prove that average cost of n insertions to BST/AVL/Splay tree can't be lower than nlog(n)?

Question

I\'m curious if you guys know an answer to this question that came to my mind.

We know that an average cost of BST insertion is O(log n)