more information
For a 𝑏 order B+ tree (max of 𝑏 children per node)
– Find, insert, and delete are all $O(log_{b}N)$
– Space is 𝑂 (n)
– Range queries can be done in $O(log_{b}N+K)$ for a range of 𝑘
• Range queries are queries that ask for all elements between two values – Elements in a range are already in order