This looks cool . .my implementation also stores counts .. and is more optimized for storing counts(intersections) than ranges Quoting from the wiki page: If

This looks cool . .my implementation also stores counts .. and is more optimized for storing counts(intersections) than ranges Quoting from the wiki page: If Int(T) is contained in X then store X at T, and finish. For the same case I split the current node into 3 intervals