Q$3.3$

$1$ Point

Which data structure$($s$)$ is$($are$)$ the most efficient $($in the worst case$)$ for deleting an item? $($mark ollf correct answers$)$:

Unsorted Array

Binary Search Tree $($BST$)$

Unsorted Linked List