Before revision:  We show that  the number r \leq n of XBWT-runs upper-bounds the size of the smallest tree attractor and lower-bounds the trie's high-order worst-case entropyH.
After revision:  We show that the trie's high-order worst-case entropyH.