If I have a structure like
std::map myMap;
myMap[\"banana\"] = 1;
myMap[\"apple\"] = 1;
myMap[\"orange\"] = 1;
How can I
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