> For the complete documentation index, see [llms.txt](https://liuzhenglaichn.gitbook.io/algorithm/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://liuzhenglaichn.gitbook.io/algorithm/data-structure/segment-tree-and-binary-index-tree.md).

# Segment Tree And Binary Index Tree

There are a group of questions with tags "Segment Tree", "Binary Index Tree", "Divide and Conquer".

* [315. Count of Smaller Numbers After Self (Hard)](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)
* [327. Count of Range Sum (Hard)](https://leetcode.com/problems/count-of-range-sum/)
* [493. Reverse Pairs (Hard)](https://leetcode.com/problems/reverse-pairs/)
* [2031. Count Subarrays With More Ones Than Zeros (Medium)](https://leetcode.com/problems/count-subarrays-with-more-ones-than-zeros/)
* [2179. Count Good Triplets in an Array (Hard)](https://leetcode.com/problems/count-good-triplets-in-an-array/)