It is an O(log n) operation if the new element is added at the end of the list.

• 如果在列表末尾添加了新元素,则此方法的运算复杂度为O(log n)。