Printable View
Could someone please help me to understand what the degree of a search tree represents? and more precisely a search tree with a degree of 4?
And how can I determine the best, average and worst case time complexity of searching this type of ADT? I can understand binary search trees but not the above described!!
Thanks
What do you think the answers are? What do your textbook and class notes say?
I'm sure you know it's rude to answer a question with a question. Well I do anyway.
It's also rude to ask other people to do your schoolwork for you, or to ask for help without demonstrating the effort you've put forth so far.Quote:
Originally Posted by mrjavajava
Please see the link in my signature on asking questions the smart way, then try again.