added docs and test

Pratham1807 · Pratham1807 · commit bd23e92411ba · 2018-10-11T02:12:54.000+05:30
diff --git a/docs/sorting/tree-sort.md b/docs/sorting/tree-sort.md
@@ -0,0 +1,38 @@
+# Tree Sort
+
+A tree sort is a sort algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements come out in sorted order. It has two phases:
+1. Frist is creating a binary search tree using the given array elements.
+2. Second phase is traversing the given binary search tree in inorder, thus resulting in a sorted array.
+
+**Performance**
+
+The average number of comparisions for this method is O(nlogn). But in worst case, number of comparisions is reduced by O(n^2), a case which arrives when the tree is skewed.
+
+
+
+## Install
+
+```
+pip install allalgorithms
+```
+
+## Usage
+
+```py
+from allalgorithms.sorting import tree_sort
+
+arr = [77, 2, 10, -2, 1, 7]
+
+print(tree_sort(arr))
+# -> [-2, 1, 2, 7, 10, 77]
+```
+
+## API
+
+### tree_sort(array)
+
+> Returns a sorted array
+
+##### Params:
+
+- `array`: Unsorted Array
diff --git a/tests/test_sorting.py b/tests/test_sorting.py
@@ -7,7 +7,8 @@
     selection_sort,
     pidgeonhole_sort,
     stooge_sort,
-    cocktail_shaker_sort
+    cocktail_shaker_sort,
+    tree_sort
 )
 
 
@@ -32,6 +33,9 @@ def test_stooge_sort(self):
 
     def test_cocktail_shaker_sort(self):
         self.assertEqual([-44, 1, 2, 3, 7, 19], cocktail_shaker_sort([7, 3, 2, 19, -44, 1]))
+    
+    def tree_sort(self):
+	self.assertEqual([-44, 1, 2, 3, 7, 19], tree_sort([7, 3, 2, 19, -44, 1]))
 
 
 if __name__ == "__main__":
