-->
In a random skip list for a set $$S$$ of size $$n$$, the operations Search, Insert, and Delete can be performed in expected time $$O(\log n)$$.答案:TRUE