diff --git a/CHANGELOG.md b/CHANGELOG.md
index 421dafa..08c1fd4 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -6,6 +6,10 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [3.1.5] - 2020-04-12
+### Fixed
+- README
+
 ## [3.1.4] - 2020-04-12
 ### Fixed
 - jsdoc
diff --git a/README.md b/README.md
index 3f22d6e..f152eaf 100644
--- a/README.md
+++ b/README.md
@@ -50,9 +50,9 @@ npm install --save @datastructures-js/binary-search-tree
 ```
 
 ## API
+Both trees have the same interface except that AVL tree will maintain itself balanced by rotating the nodes that become unbalanced during insertion and deletion. If your code requires a strictly balanced tree that always benefits from the **log(n)** runtime of insert & remove, you should use the AVL one.
 
 ### require
-Both trees have the same interface except that AVL tree will maintain itself balanced due to rotating nodes that become unbalanced on insertion and deletion. If your code requires a strictly balanced tree that always benefits from the **log(n)** runtime of insert & remove, you should use AVL.
 
 ```js
 const { BinarySearchTree, AvlTree } = require('@datastructures-js/binary-search-tree');
diff --git a/package.json b/package.json
index d163c2e..83aa11e 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@datastructures-js/binary-search-tree",
-  "version": "3.1.4",
+  "version": "3.1.5",
   "description": "binary search tree & avl tree (self balancing tree) implementation in javascript",
   "main": "index.js",
   "scripts": {