title: MySQL indexing and data access time complexity
body: <p>in <code>MySQL</code> i read that data access time complexity when we have an indexing over a specific data column is <code>log(n)</code> because of using a BTree, do there any scenario that data access time became more that <code>log(n)</code> for example <code>O(n)</code>, because when we insert data in sorted manner into a BTree the tree grows in one side and data access complexity grows to <code>O(n)</code> do they have any policy on inserting data into this indexing BTree ?? thanks for answering</p>