- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- Binary Search can be categorized into wh...

Q. |
## Binary Search can be categorized into which of the following? |

A. | Brute Force technique |

B. | Divide and conquer |

C. | Greedy algorithm |

D. | Dynamic programming |

Answer» B. Divide and conquer |

View all MCQs in:
Data Structures (DS)

- When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
- 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
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
- In which of the following self – balancing binary search tree the recently accessed element can be accessed quickly?
- A self – balancing binary search tree can be used to implement
- A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
- In a binary search tree, which of the following traversals would print the numbers in the ascending order?
- Which of the following is false about a binary search tree?
- Which of the following is not the self balancing binary search tree?
- Which of the following is a self – balancing binary search tree?

Login to Continue

It will take less than 2 minutes

Report MCQ