RBT_RANK
#ifndef RBT_RANK
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));
indent, "", n->key, n->size, RBT_RANK(tree, n),
rank = RBT_RANK(tree, RBT_ROOT(tree, &root));