Describe how to implement a search tree that has a worst time search, insert, and delete time of no more than O$($lg n$).$ This tree should have no number of element limit$.$

Do the six functions defined for binary search trees.

Discuss how you would implement this if there was a maximum to the number of elements.