In actual use, the choice will be based on the different advantages of data structures such as linked lists and ordered arrays. The advantage of sorted array is binary search, and the advantage of linked list is insertion of data items and deletion of data items. But inserting data in an ordered array is slow, and looking up data items in a linked list is inefficient. In view of the above, a binary tree can take advantage of the advantages of linked lists and ordered arrays, and at the same time it can combine the advantages of ordered arrays and linked lists. Binary trees are also a commonly used data structure.
https://blog.csdn.net/cai2016/article/details/52589952