Improve performance of Splay Tree in crdt.Text data structure to prevent skewness

[m4ushold]

Description:
In the crdt.Text data structure, Splay trees are used, and while they are efficient when performing operations sequentially within a contiguous range, they suffer from the issue of becoming skewed when elements are sequentially inserted. This leads to a linear arrangement in the tree. In a tree with N vertices, performing M operations guarantees O((N+M) log N) time. However, if the tree becomes skewed, each operation may initially take O(N) time before returning to more efficient performance. This issue can cause performance degradation in the crdt.Text data structure, making it crucial to explore methods to prevent skewness and maintain efficiency.

• same issue

Why:
To maintain and enhance the performance and efficiency of the crdt.Text data structure in the face of potential skewness issues in the Splay trees. And If a single operation takes O(n) time, the responsiveness of the editing environment will degrade.