+1 vote
in Data Structures & Algorithms I by (110k points)
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.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (d) O (1)

Explanation: In order to perform the concatenation on the rope data structure, one can create two nodes S1 and S2 and then performing the operation in constant time that is the time complexity is O (1).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.