redis的zset底层

引用提到，Redis选择使用跳跃表（Skip List）来实现有序集合（ZSET），而不是使用红黑树。这是因为跳跃表的实现相对于红黑树更加简洁。跳跃表的查询复杂度的期望是O(logN)。所以，Redis使用跳跃表来实现有序集合可以提供较好的性能。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* *3* [面试官：你了解过Redis对象底层实现吗](https://blog.csdn.net/javazhiyin/article/details/93999141)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT0_1"}}] [.reference_item style="max-width: 50%"]
- *2* [redis跳表——zset的底层实现](https://blog.csdn.net/qq_42410605/article/details/122517927)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT0_1"}}] [.reference_item style="max-width: 50%"]
[ .reference_list ]