Contents

- 1 What are advantages and disadvantages of Optimal binary search tree?
- 2 What is the limitation of B tree?
- 3 What is the disadvantage of binary search algorithm Mcq?
- 4 What is the main disadvantage of a binary search compared to a linear search?
- 5 What are the advantages of BST?
- 6 What are the worst case and average case complexity of a binary search tree?
- 7 Which of the following is disadvantage of B plus tree?
- 8 What are the advantages of B-tree?
- 9 Which is not limitation of binary search algorithm?
- 10 What is a disadvantage of a linear search?
- 11 What are the drawbacks of AVL trees?

## What are advantages and disadvantages of Optimal binary search tree?

Compared to linear search (checking each element in the array starting from the first), binary search is **much faster**. Linear search takes, on average N/2 comparisons (where N is the number of elements in the array), and worst case N comparisons. Binary search takes an average and worst-case log2(N)log2(N) comparisons.

## What is the limitation of B tree?

Disadvantages: **Leaf and non-leaf nodes are of different size (complicates storage)** **Deletion may occur in a non-leaf node (more complicated)**

## What is the disadvantage of binary search algorithm Mcq?

binary search algorithm **is not efficient when the data elements are more than 1000**. … binary search algorithm is not efficient when the data elements are more than 1000.

## What is the main disadvantage of a binary search compared to a linear search?

It is less efficient in the case of large-size data sets. It is more efficient in the case of large-size data sets. In a linear search, the worst- case scenario for finding the element is O(n). In a binary search, the worst-case scenario for finding the element is **O(log2n)**.

## What are the advantages of BST?

Advantages of using binary search tree The binary search tree is **considered as efficient data structure in compare to arrays and linked lists**. In searching process, it removes half sub-tree at every step. Searching for an element in a binary search tree takes o(log2n) time.

## What are the worst case and average case complexity of a binary search tree?

Binary search's average and worst case time complexity is **O ( log n ) O(\log n) O(logn)**, while binary search tree does have an average case of O ( log n ) O(\log n) O(logn), it has a worst case of O ( n ) O(n) O(n).

## Which of the following is disadvantage of B plus tree?

✦ (Minor) disadvantage of B+ trees: – **extra insertion and deletion overhead, space overhead**. and n children.

## What are the advantages of B-tree?

Advantages of B-tree usage for databases keeps keys in sorted order for sequential traversing. uses a hierarchical index to minimize the number of disk reads. uses partially full blocks to speed up insertions and deletions. keeps the index balanced with a recursive algorithm.

## Which is not limitation of binary search algorithm?

binary search algorithm is **not efficient when the data elements are more than 1000**. Answer» a. binary search algorithm is not efficient when the data elements are more than 1000.

## What is a disadvantage of a linear search?

Disadvantages of a linear search The drawback of a linear search is the fact **that its time consuming for the enormous arrays**. … Every time a vital element matches the last element from the array or an essential element does not match any element Linear search algorithm is the worst case.

## What are the drawbacks of AVL trees?

**Disadvantages of AVL Trees**

- As you can see, AVL trees are difficult to implement.
- In addition, AVL trees have high constant factors for some operations.
- Most STL implementations of the ordered associative containers (sets, multisets, maps and multimaps) use red-black trees instead of AVL trees.