116) Which of these is the worst case time complexity for looking up a key in a binary search tree - and cannot be expressed in lower order terms ?

117) The graph algorithm which forms an essential component of the ′make′ or ′ant build′ used by programmers and software developers is:

118) The time complexity of linear search algorithm over an array of n elements is

119) The time required to search an element in a linked list of length n is

120) The worst case time required to search a given element in a sorted linked list of length n is