actually i am looking for sorting procedure by which i can sort the
nodes when i am reading that node .
Unfortunatelly, still not "really" clear...
However, I believe there are two standard-library utilities to help you.
Either std::sort which can sort the nodes when you have finished, but I
think this is not what you want.
As I suggested, std::set (or multi-set) could be what you are looking
for; this is a container where you can insert elements and they are kept
and accessible in sorted order at every time; look at the documentation
for details, for instance
http://www.sgi.com/tech/stl/set.html
Hope this is really what you want,
yours,
Daniel
--
Got two Dear-Daniel-Instant Messages
by MSN, associate ICQ with stress --
so please use good, old E-MAIL!