[algogeeks] Length of internal path in a binary tree

Hi, Can anybody please suggest where I can find an algorithm that recursively calculates the length of the internal path in a binary tree? Thanks. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks

[algogeeks] Polynomial Growth

Hi! Can somebody please tell me how you can determine if a function has polynomial growth? Thanks!!! --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

[algogeeks] HEAP SORT

Hi, Can somebody please help me understand Heap Sort. How to build a heap and how can I prove that the worst case is nlogn? Thank you for your help. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm

[algogeeks] Re: 0-1 Knapsack Problem

Thank you so much. --~--~-~--~~~---~--~~ 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 [EMAIL

[algogeeks] Re: 0-1 Knapsack Problem

Thank you!!! --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED]

[algogeeks] 0-1 Knapsack Problem

n objects x1...xn, each having weight wi and profit pi, are to be placed into a sack with capacity M. Can somebody please help me write a algorithm that determines which objects should be placed in the sack inorder to maximize the profit. --~--~-~--~~~---~--~~