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!!