so know operation on bst operate in log time because of halving of structure, wondering time complexity if search value not in structure.
the average case time complexity o(log n) , worst case o(n). understand o(log n) complexity can refer what o(log n) mean exactly?
this image explain how part:
i recommend go through wiki details.
Comments
Post a Comment