sorting a hash map without creating a new treemap

Hi all,
I have following questions:
1)Is there any other way to sort a hashmap(based on key ordering) without using treemap?
2)IF there is a way to sort a hashmap without creating a new instance of treemap,so it is consume lots of time as compare to sorting it with creating a new of treemap??

Please help me to solve my puzzle.
Thanks in advance:
(happy):