ans:4 On Thu, Jul 26, 2012 at 11:26 PM, Ali Ahmad Ansari < ali.ahamad.ans...@gmail.com> wrote:
> Insert the numbers in the sequence "8, 5, 1, 4, 2, 10, 12, 7, 3" into a > min-heap. The order of insertion is as given. The insertion happens as > described here<http://en.wikipedia.org/wiki/Binary_heap#Adding_to_the_heap> > . > > If the root is said to be at level 1, the root's children at level 2, and > so on, what is the level in which 8 occurs in the heap? > > · a. 1 > > · b. 2 > > · c. 3 > > · d. 4 > > · e. 5 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/lfNrsE_muCAJ. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
