If the data is present in the SkipList, then the algorithm will find it in the highest level that contains said data.

If the data is present in the SkipList, then the algorithm will always take at least time.

If the data is not present in the SkipList, then the algorithm will always take at least time.

If the SkipList's levels are prefectly balanced in the number of nodes per level $($i$.$e$.$ the bottom level has nodes, the second level has nodes, the third level has nodes, etc.$),$ then we can guarantee that any search takes at most time.

Each tower of data $($if present$)$ has a unique location in the SkipList.