Hi there,
Is it possible to traverse a min heap to get a sorted list? Using pre/post/in traversal.?
Just need to clear some concept issues.
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Traversing a min heap to get sorted
Hi there,
Is it possible to traverse a min heap to get a sorted list? Using pre/post/in traversal.?
Just need to clear some concept issues.
Related threads:
Re: Traversing a min heap to get sorted
In the traditional sense of the word traversal, I don't think you can do this. I believe the tree must first be sorted (for example with a heapsort) and then traversed.Originally Posted by derek
Re: Traversing a min heap to get sorted
Traversing through a heap has little meaning in terms of sorted order (either min heap or max heap). You must remove the top item from the heap and re-validate the heap to get the items back into a sorted order.
Traversing through a binary search tree using "in-order" traversal (left, node, right) will give you the sorted order of the items.
Reply With Quote