What is the time complexity for creating a new node and then performing concatenation in the rope data structure?

(a) O (log n)

(b) O (n!)

(c) O (n^2)

(d) O (1)

This interesting question is from Binary Trees topic in portion Binary Trees of Data Structures & Algorithms I

The question was posed to me in an interview for internship.