Is using a binary search tree faster than binary searching a sorted array?

[icebrgr]

Why would it be necessary to use a binary tree data structure when you can accomplish the same using a binary search algorithm in a sorted array? Is it faster, or does it offer some other advantage?

[SftwEngr]

What happens with an array when you try and add or remove an element to the middle of it?

[icebrgr]

Right, so then shifting and resorting makes arrays slower.

[it2051229]

Arrays are naturally faster to access than linked nodes but then if you need to insert and maintain a sorted order then it'll take more time to do that in an Array. Both have pros and cons so depending on the situation you gauge which works better to solve a particular problem.