---
title: "Discussion on \"Skip Lists: The O(log n) Alternative to Balanced Trees\" | Hashnode"
description: "Discussion on \"Skip Lists: The O(log n) Alternative to Balanced Trees\". Discover how skip lists achieve O(log n) search time using a probabilistic hierarchy, making them a simpler, concurrency-friendly alternative to trees."
url: "https://hashnode.com/posts/skip-lists-data-structure-explained/6aabf6d3747e8e443f91cd68"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Skip Lists: The O(log n) Alternative to Balanced Trees](https://doogal.dev/skip-lists-data-structure-explained?utm_source=hashnode&utm_medium=feed)

Discover how skip lists achieve O(log n) search time using a probabilistic hierarchy, making them a simpler, concurrency-friendly alternative to trees.

Sep 17 · 5 min read · doogal.dev  
Read the article

-   [#datastructures](https://hashnode.com/tag/datastructures)
-   [#computerscience](https://hashnode.com/tag/computerscience)
-   [#softwareengineering](https://hashnode.com/tag/softwareengineering)
-   [#databases](https://hashnode.com/tag/databases)

## Written by

[Doogal Simpson](https://hashnode.com/@doogal)

@doogal

  
[View profile](https://hashnode.com/@doogal)

"hey doogal, what is .... ?"

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
