判断题：If we build a skip list for $$n$$ elements, then we can search o

If we build a skip list for $$n$$ elements, then we can search or delete any element  in $$O(\log n)$$ time in the worst case.

答案：FALSE