1)Is there some way I can make a std:riority_queue which pops in ascending order ?
I know that it uses the '<' operator to sort while poping. So if overload '<' operator do '>' , it might work. But it is wrong to do that.
2) is there an STL search tree or do I have make one?
If there is no search tree, how do I search in a queue sine i dont see any mem-function or iterators access other elements in between 'front' and 'back'.