Hi all, i have 3 short questions that i would like answered.
1) What is the best case complexity for a tree of degree(4). I said B(n) = n. Is it B(n)=1? I think it is the first case 2) Also, is the average case for a doubly circular queue A(n)=n+1/2 3) Lastly, is the worst-case of a search tree to degree 4 W(n)=n Cheers, Peri --~--~---------~--~----~------------~-------~--~----~ 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] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
