- Computer Science Engineering (CSE)
- Data Structures (DS)
- The complexity of Binary search algorith...

Q. |
## The complexity of Binary search algorithm is ____________. |

A. | O(n). |

B. | O(log n ). |

C. | O(n2). |

D. | O(n log n). |

Answer» B. O(log n ). |

View all MCQs in:
Data Structures (DS)

- What is the worst case complexity of binary search using recursion?
- What is the average case time complexity of binary search using recursion?
- What is the time complexity of binary search with iteration?
- The complexity of linear search algorithm is____________.
- Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
- When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
- Binary search algorithm cannot be applied to________ concept.
- What is the average case time complexity for finding the height of the binary tree?
- What is the best case and worst case complexity of ordered linear search?

Login to Continue

It will take less than 2 minutes

Report MCQ