Q$3\mathrm{.}2$

$1$ Point

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

Binary Search Tree $($BST$)$

Unsorted Linked List

Sorted Array

Sorted Linked List

Last saved on Feb $06$ at $12-55$ PM