The remapping tree may be structured as an AVL tree. An AVL tree is a self-balancing binary search tree in which heights of child subtrees of any node may differ by no more than one. FIG. 5 illustrates an exemplary remapping tree. As one can see in the exemplary remapping tree, ...