Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

[Tutorial] Splay Tree: One Tree to Rule Them All
Difference between en1 and en2, changed 0 character(s)
_Are you scared when you hear about all these pesky data structures like Fenwick Tree, RMQ, Segment Tree in competitive programming?_↵
↵
_Are you afraid of writing code to solve problems like finding the minimum, maximum, or sum of some range query, especially when there are updates to the data?_↵
↵
_Well, fear no more! In this tutorial I will introduce the Swiss knife of all sequence manipulation data structure, one code that can (theoretically) solve every problem of this kind, one tree to rule them all — the Splay Tree!_↵
↵
So this is a tutorial I wrote on the Splay Tree:↵
↵
[https://zhtluo.com/cp/splay-tree-one-tree-to-rule-them-all.html](https://zhtluo.com/cp/splay-tree-one-tree-to-rule-them-all.html)↵
↵
Feedback and additional practice problems are welcomed. Enjoy :)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Zhtluo 2022-10-27 01:29:33 0 (published)
en1 English Zhtluo 2022-10-27 01:27:01 837 Initial revision (saved to drafts)