Both has search complexity of logn(for BST it is from n - logn), but Binary Search using array has insertion and deletion complexity of n.
BST has insertion and deletion complexity of logn