Succinct trees

Previous slides: Rank & Select , Elias-Fano Link to heading Rank: counting 1 bits 2 levels of blocks of length \(\log^2 n\) and \(\log n\) Select: finding 1 bits 2 levels of blocks with \(\log^2 n\) 1-bits and \(\sqrt{\log n}\) 1-bits. There exist succinct \(o(n)\) space data structures for rank and select. Elias-Fano: efficient encoding of sorted list of integers Split in high and \(\ell\)-bit…