PA of Algorithms Q31

0. In the worst case, the number of comparisons needed to search singly linked list of length n for a given element is

  • Option : D
  • Explanation :
    The worst case number of comparison is n. to search any element from singly link list.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *