Fixed a typo

Author: kelvinlauKL

B-Tree/README.md

@@ -7,7 +7,7 @@ A B-Tree is a self-balancing search tree, in which nodes can have more than two
 A B-Tree of order *n* satisfies the following properties:
  - Every node has at most *2n* keys.
  - Every node (except root) has at least *n* keys.
- - Eyery non-leaf node with *k* keys has *k+1* children.
+ - Every non-leaf node with *k* keys has *k+1* children.
  - The keys in all nodes are sorted in increasing order. 
  - The subtree between two keys *k* and *l* of a non-leaf node contains all the keys between *k* and *l*.
  - All leaves appear at the same level.