This question already has an answer here:
when discussing average time complexity as in this table.
O (log n)
I'm assuming it is 2 but wanted to verify. Also is it always 2 for these data structures?
I'm in the opinion that the base of the log is not considered a constant so it should be included in the Big O notation.
Whether or not is should be included. What is the actual value?