Binary search algorithm can not be applied to

A. sorted linked list

B. sorted binary trees

C. sorted linear array

D. pointer array

Related Questions

  1. Merge sort uses ?
  2. The number of possible ordered trees with three nodes A,B,C is?
  3. _____ is not the component of data structure.
  4. Which of the following is not a limitation of binary search algorithm?
  5. Two main measures for the efficiency of an algorithm are
  6. The elements of an array are stored successively in memory cells because
  7. To represent hierarchical relationship between elements, Which data structure is suitable?
  8. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  9. Which of the following data structure is non linear type?
  10. A variable P is called pointer if
  11. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  12. If the values of a variable in one module is indirectly changed by another module, this situation is…
  13. The complexity of Binary search algorithm is
  14. Which of the following is true about the characteristics of abstract data types? i) It exports a type.…
  15. A data structure where elements can be added or removed at either end but not in the middle
  16. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  17. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  18. Linked list are not suitable data structure of which one of the following problems ?
  19. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
  20. When determining the efficiency of algorithm, the space factor is measured by
  21. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  22. Which of the following name does not relate to stacks?
  23. Stack is also called as
  24. The term push and pop is related to the
  25. Which data structure is used in breadth first search of a graph to hold nodes?
  26. Two dimensional arrays are also called
  27. Which of the following statement is true ?
  28. ……………. Is a pile in which items are added at one end and removed from…
  29. Herder node is used as sentinel in ____
  30. The complexity of Bubble sort algorithm is

Please do not use chat terms. Example: avoid using "grt" instead of "great".