Hi This question pertains to boost::heap::skew_heap as defined here:- http://www.boost.org/doc/libs/1_51_0/doc/html/boost/heap/skew_heap.html Can you please help me understand what is the complexity of skew heap traversal using ordered_iterator. I am traversing over the heap, using ordered_iterator as shown in code below :- for(bk_heap::ordered_iterator it=buy_heap->ordered_begin();it!=buy_heap->ordered_end();it++) { /// some code here... } I suspect it to be O(n), but just want to make sure. Thanks in advance. -- View this message in context: http://boost.2283326.n4.nabble.com/boost-heap-skew-heap-1-51-0-ordered-itera... Sent from the Boost - Users mailing list archive at Nabble.com.