New posts in Btree

How is it possible for Hash Index not to be faster than Btree for equality lookups?

Does mysql use B-tree,B+tree or both?