Rank Tree in C++

Question

We need ADT having search and rank features. That is, in addition to the interface of STL map, a function \'int get_rank(key)\' is required.

Standard implementation

Answer 1

you can use some other map like containers .
keep a size fields can make binary search tree easy to random access .
here is my implementation ...
std style , random access iterator ...
size balanced tree ...
https://github.com/mm304321141/zzz_lib/blob/master/sbtree.h
and B+tree ...
https://github.com/mm304321141/zzz_lib/blob/master/bpptree.h