Hi i am looking for urgent assistence.

PLease help Describe a data structure that supports the following operations:

split, concat, and lookup in O(log n) time (either worst-case, expected, or amortized).

newstring in O(1) worst-case and amortized time

. reverse in O(1) worst-case and amortized time.

Describe a data structure that supports the following operations:

concat in O(log n) amortized time.

newstring and lookup in O(1) worst-case and amortized time.

reverse in O(1) worst-case and amortized time. is data structure does not need to support split at all..