Update README.md

Author: AnghelLeonard

binarysearchtree/README.md

@@ -14,3 +14,8 @@
 - Abstract syntax trees for compilation of computer languages.
 - Huffman trees for compression of data.
 - Routing trees for network traffic.
+
+# Java Implementations for Binary Search Trees
+
+- No Java default implementation
+- This is an [example]() of a binary search tree implementation providing the following features (add, delete, print, get the tree as a list or iterator traversed in-order, pre-order, post-order and level-order, min, max, size, height, contains, etc)