Concepts2
🗂️Data StructureIntermediate
Merge Sort Tree
A Merge Sort Tree is a segment tree where every node stores the sorted list of values in its segment.
#merge sort tree#segment tree#range query+12
🗂️Data StructureIntermediate
2D Fenwick Tree
A 2D Fenwick Tree (Binary Indexed Tree) supports point updates and rectangle sum queries in O(log n × log m) time.
#2d fenwick tree#binary indexed tree 2d#bit 2d+12