- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- What is the time complexity of binary se...

Q. |
## What is the time complexity of binary search with iteration? |

A. | O(nlogn) |

B. | O(logn) |

C. | O(n) |

D. | O(n2) |

Answer» B. O(logn) |

View all MCQs in:
Data Structures (DS)

- What is the average case time complexity of binary search using recursion?
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
- What is the worst case complexity of binary search using recursion?
- The complexity of Binary 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___________.
- What is the average case time complexity for finding the height of the binary tree?
- The time required in best case for search operation in binary tree is ____________.
- What is the best case and worst case complexity of ordered linear search?
- The complexity of linear search algorithm is____________.

Login to Continue

It will take less than 2 minutes

Report MCQ