Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
exam question help please_2
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
Related threads:
Re: exam question help please_2
What do you think the answers are? What do your textbook and class notes say?
Useful links: How to Ask Questions the Smart Way | Use Code Tags | Java Tutorials
Static Void Games - Play indie games, learn from game tutorials and source code, upload your own games!
Re: exam question help please_2
I'm sure you know it's rude to answer a question with a question. Well I do anyway.
Re: exam question help please_2
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.Originally Posted by mrjavajava
Please see the link in my signature on asking questions the smart way, then try again.
Useful links: How to Ask Questions the Smart Way | Use Code Tags | Java Tutorials
Static Void Games - Play indie games, learn from game tutorials and source code, upload your own games!
Reply With Quote