Search Mechanism

• Begin at the head node of the highest nonempty level.
• Inspect the next node on the current level.
• If the next node has key T, the target has been found.
• If the next key is smaller than T, move horizontally to that node.
• If the next key is greater than T, or if no next node exists, descend by one level.
• Repeat until the target is found or its possible position is passed in L₀.