Heap sort algorithm

Question

I have a heap made of a binary tree. Its not an array. I was wondering how would i go about sorting this. I know i need to take the last node and place it at the root and do a down heap bubble. This part i have. The problem I am having is knowing how to get the new last node. Is there an algorithm to find the last node? Do i need to keep track of each of the parent nodes on each node?

Thanks.

Is it a min or max heap?

mellamokb
– mellamokb

2011-02-23 04:15:38 +00:00
Commented Feb 23, 2011 at 4:15 — mellamokb
– mellamokb, Commented Feb 23, 2011 at 4:15

CodePartizan · Accepted Answer · 2011-02-23 04:32:10Z

2

Assuming the tree you start with is a full tree, I would see if you can keep track of the height of each node.

Then, when you iterate through the tree looking for the next child to remove you do a check at each node. If L.h > R.h go left, else go right. The only caveat I have on this idea is it means when you take that node you need to update all the heights. Which add a cost of O(log n). But since you're traversing down the tree which is theta(log n) it's not too big a deal asymptotically.

answered Feb 23, 2011 at 4:32

CodePartizan

3384 silver badges7 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Matt Over a year ago

Yea i thought about that. Theres no easy way to do it unless its vector based. Thanks.

Collectives™ on Stack Overflow

Heap sort algorithm

1 Answer 1

1 Comment

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

1 Comment

Your Answer

Sign up or log in

Post as a guest

Linked

Related