MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Self Balancing Binary Search Tree Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
In which of the following self balancing binary search tree the recently accessed element can be accessed quickly? |
| A. | AVL tree |
| B. | AA tree |
| C. | Splay tree |
| D. | Red Black tree |
| Answer» D. Red Black tree | |
| 2. |
A self balancing binary search tree can be used to implement ________ |
| A. | Priority queue |
| B. | Hash table |
| C. | Heap sort |
| D. | Priority queue and Heap sort |
| Answer» B. Hash table | |
| 3. |
Which of the following is a self balancing binary search tree? |
| A. | 2-3 tree |
| B. | Threaded binary tree |
| C. | AA tree |
| D. | Treap |
| Answer» D. Treap | |
| 4. |
Self balancing binary search trees have a much better average-case time complexity than hash tables. |
| A. | True |
| B. | False |
| Answer» C. | |
| 5. |
An AVL tree is a self balancing binary search tree, in which the heights of the two child sub trees of any node differ by _________ |
| A. | At least one |
| B. | At most one |
| C. | Two |
| D. | At most two |
| Answer» C. Two | |
| 6. |
The binary tree sort implemented using a self balancing binary search tree takes ______ time is worst case. |
| A. | O(n log n) |
| B. | O(n) |
| C. | O(n<sup>2</sup>) |
| D. | O(log n) |
| Answer» B. O(n) | |