The advantage of a binary search tree over a vector in C ++

Question

What is the use of a binary search tree data structure if a vector (in sorted order) can support inserting, deleting, and searching in log (n) time (using binary search)?

Answer 1

The main advantage of the tree is that the insertion and deletion in the vector is not O (log (n)) - it is O (n). (They take log (n) comparisons, but n moves.)

The advantage of the vector is that the constant factor can be extremely in their favor (because they are usually much more cache friendly, and misses in the cache can cost you 100% performance).

,

• .
• , .

,

• .
• .

... , O (1) + ( O (n) , , ).

Answer 2

BST, /. , BST. , , .

, /, , , .

Answer 3

O (log (n)). BST vs vector, :

BST "node", node . , ( ) . , , , , BST , .