Which data structure is better?

Arrays

Searching

• If it is unsorted, we need to iterate through the whole array

• If sorted, we can use binary search

Insertion

• If it is unsorted, we can easily append it to the back of our array

• If it is sorted, that means we need to insert it in the right place by iterating through the whole array to find the suitable place for it. The worst case for it is when it should be inserted at the back of the array, so it is not really useful when doing insertion.

Deletion

• If it is unsorted, we can change the value of the item we want to delete with the last item of the array then just remove the last element of the array, which will take constant time.

• If it is sorted, we need to move all elements that are behind the element which we want to delete to replace the blank space after removing the element's value.

Linked List

Searching

• We need to iterate through the whole link

Insertion/Deletion

• As it is just a set of pointers pointing to their respective values, we can easily remove that pointer from its set.

Binary Search Tree

Searching

• Searching is fast because we half the range until the desired value is found, just like binary search

Insertion

• Fast, we can insert it to the most-bottom node which still doesn't have a child.

Deletion

• Fast too, when deleting a node, just replace its child with its parent.

Therefore, Binary Search Tree is the best when designing an algorithm for searching and insertion/deletion.

Binary Search Tree has the least complexity... O(log n) , so it is the best when using it for both searching and insertion/deletion

Its because BST has complexity of log n where n is no. of elements while arrays has complexity of n in sorting and deleting and inserting any element in between array requires the shifting of all preceding ones