Contents

- 1 What are advantages of BST?
- 2 What are the advantages and disadvantages of binary tree?
- 3 What is the disadvantages of a binary search?
- 4 What are the advantages and disadvantages of implementing a tree?
- 5 What is the limitation of BST with respect to performance?
- 6 What is the biggest disadvantage of a binary search?
- 7 What are advantages of trees?
- 8 What are the advantages and disadvantages of linear search?
- 9 What are the advantages of binary search over sequential search?
- 10 What are the disadvantages of implementing tree using normal array?
- 11 What are the advantages and disadvantages of using an AVL tree?
- 12 What are the advantages and disadvantages of binary search algorithm over linear search algorithm?
- 13 What are the pros and cons of planting trees?
- 14 What are 3 benefits of trees?
- 15 What is the pros and cons of linear search algorithm?

## What are advantages of BST?

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. … It also speed up the insertion and deletion operations as compare to that in array and linked list.

## What are the advantages and disadvantages of binary tree?

- It's more complicated than linear search, and is overkill for very small numbers of elements.
- It works only on lists that are sorted and kept sorted.
- It works only on element types for which there exists a less-than relationship.
- There is a great lost of efficiency if the list does not support random-access.

## What is the disadvantages of a binary search?

**Binary Search Algorithm Disadvantages-**

- It employs recursive approach which requires more stack space.
- Programming binary search algorithm is error prone and difficult.
- The interaction of binary search with memory hierarchy i.e. caching is poor.

## What are the advantages and disadvantages of implementing a tree?

The greatest advantage of having a tree in an array format is you save memory by storing fewer pointers. The disadvantages of having an array implementation of a tree is **that it has a fixed size**, which makes it harder to grow and, depending on the size of the array, can take a long time to grow.

## What is the limitation of BST with respect to performance?

The problem with BST is that, depending on the order of inserting elements in the tree, **the tree shape can vary**. In the worst cases (such as inserting elements in order) the tree will look like a linked list in which each node has only a right child.

## What is the biggest disadvantage of a binary search?

The biggest problem with a binary search is that **you can only use this if the data is sorted into an order**.

## What are advantages of trees?

**Trees give off oxygen that we need to breathe**. Trees reduce the amount of storm water runoff, which reduces erosion and pollution in our waterways and may reduce the effects of flooding. Many species of wildlife depend on trees for habitat. Trees provide food, protection, and homes for many birds and mammals.

## What are the advantages and disadvantages of linear search?

**The list does not need to sorted**. Unlike a binary search, linear searching does not require an ordered list. Not affected by insertions and deletions. As the linear search does not require the list to be sorted, additional elements can be added and deleted.

## What are the advantages of binary search over sequential search?

**Advantages of binary search over sequential search**

- Sequential Search. Sorted list is not required. It can be used in linked list Implementation. It is suitable for a list changing very frequently.
- Binary search. Sorted list is required. It cannot be used in liked list Implementation.

Jun 21, 2019

## What are the disadvantages of implementing tree using normal array?

What is/are the disadvantages of implementing tree using normal arrays? Explanation: **The size of array is fixed in normal arrays**. We need to know the number of nodes in the tree before array declaration. It is the main disadvantage of using arrays to represent binary trees.

## What are the advantages and disadvantages of using an AVL tree?

AVL trees have both advantages and disadvantages over other self balancing trees. It **is highly efficient when there is a large number of input data which involves a lot of insertions**. With this large input set insertion in BST can even tend to O(n) time complexity for each input(a case where all input data are sorted).

## What are the advantages and disadvantages of binary search algorithm over linear search algorithm?

The main advantage of using binary search is **that it does not scan each element in the list**. Instead of scanning each element, it performs the searching to the half of the list. So, the binary search takes less time to search an element as compared to a linear search.

## What are the pros and cons of planting trees?

**2.** **Pro: They Offer Shade**

- Pro: They Become Part of the Ecosystem. Trees don't just provide benefits to you; they benefit the entire ecosystem in your yard.
- Con: The Roots Grow. The roots of your tree grow, which can interfere with other things in or around your yard.
- Con: They Attract Pests.
- Con: They Grow Slowly.

Sep 6, 2019

## What are 3 benefits of trees?

**Trees give off oxygen that we need to breathe**. Trees reduce the amount of storm water runoff, which reduces erosion and pollution in our waterways and may reduce the effects of flooding. Many species of wildlife depend on trees for habitat. Trees provide food, protection, and homes for many birds and mammals.

## What is the pros and cons of linear search algorithm?

**The list does not need to sorted**. Unlike a binary search, linear searching does not require an ordered list. Not affected by insertions and deletions. As the linear search does not require the list to be sorted, additional elements can be added and deleted.