The time bound of the FIND operation in a B+ tree containing $$N

The time bound of the FIND operation in a B+ tree containing $$N$$ numbers is $$O(\log N)$$, no matter what the degree of the tree is.

答案：TRUE