Both a sorted array and a binary tree can let you look up an element in log(N) time. However I would expect a sorted array to be faster in practice because of the constant factor. However inserting ...

I need help with an assignment from my Data Sturctures class. <BR><BR>We are creating a tree class and I need to add code that can find a node and delete it.<BR><BR>Any help would be ...