Re: Max & Min Heap

[Mehreen Saeed]

Hafsa, I do not understand your question but max heap and min heap are both complete trees. So make sure after insertion the tree is complete. 

Mehreen

-------- Original message --------
From Hafsa Tariq <hafsata...@gmail.com>
Date: 07/06/2015 12:10 (GMT+05:00)
To dsfas...@googlegroups.com
Subject Max & Min Heap

this question is solved with the max heap (inserting from left to right).

 But Is it possible to insert in minimum heap, which follow the convention inserting each entry from right to Left ? 

--
You received this message because you are subscribed to the Google Groups "DSFAST2015" group.
To unsubscribe from this group and stop receiving emails from it, send an email to dsfast2015+...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/dsfast2015/23deb49d-7cd8-4ae5-b1fc-1ac65aae7ce0%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.