What is the time complexity for maintaining a dynamic set of weighted trees?

(a) O (n)

(b) O (n^2)

(c) O (log n)

(d) O (n!)

This is a very interesting question from Binary Trees in section Binary Trees of Data Structures & Algorithms I

I have been asked this question at a job interview.