014 MySQL官网 术语汇编/难词汇编（glossary）中的B+Tree解释

学软件技术，读第一手资料，去官方网站：MySQL 5.7参考手册

也可以看看比较经典的书籍，如《高性能MySQL》等

---

B+Tree，直接看官网，点我

B-tree（从技术上来说，实际上是B+Tree，切记！！！）

    A tree data structure that is popular for use in database indexes. The structure is
 kept sorted at all times, enabling fast lookup for exact matches (equals operator) and
 ranges (for example, greater than, less than, and BETWEEN operators). This type of 
index is available for most storage engines, such as InnoDB and MyISAM.

    Because B-tree nodes can have many children, a B-tree is not the same as a binary tree,
 which is limited to 2 children per node.

    Contrast with hash index, which is only available in the MEMORY storage engine. 
The MEMORY storage engine can also use B-tree indexes, and you should choose B-tree 
indexes for MEMORY tables if some queries use range operators.

    The use of the term B-tree is intended as a reference to the general class of index 
design. B-tree structures used by MySQL storage engines may be regarded as variants 
due to sophistications not present in a classic B-tree design. For related information, 
refer to the InnoDB Page Structure Fil Header section of the MySQL Internals Manual.

    See Also hash index.

上面那么多，重点看这句：

B+Tree ，The structure is kept sorted（保持顺序） at all times, enabling fast lookup（快速查找） for exact matches (equals operator，精确匹配) and ranges (for example, greater than, less than, and BETWEEN operators，范围查找).