Why MySQL Uses B+Tree As The Index?

A tree data structure is prevalent in database index design. It can always keep the data sorted, so users can search for exact matches and ranges more efficiently. But why choose B+tree over other tree structures? How about Binary Search Tree? Let's ...