Concepts2
🗂️Data StructureAdvanced
Persistent Array and Treap
Persistence lets you keep every past version of a data structure while making O(log n) updates and queries on any version.
#persistent array#persistent segment tree#treap+12
🗂️Data StructureAdvanced
Treap
A treap is a binary search tree on keys combined with a heap on random priorities, which keeps the tree balanced in expectation.
#treap#randomized bst#fhq treap+12