Currently we use TreeMap for node2blocks, actually there are only two place may need sorted: dump, getDatanodes. But getDatanodes is called by computeInvalidateWork, and we do a shuffle there, so the sort is unnecssary. For dump, certainly we need to make few modification.
So we can use HashMap.
From memory and performance view, HashMap is better than TreeMap, a simliar optimization