modified tree_sort

Pratham1807 · Pratham1807 · commit 9a90a70124a6 · 2018-10-11T21:27:58.000+05:30
diff --git a/allalgorithms/sorting/tree_sort.py b/allalgorithms/sorting/tree_sort.py
@@ -1,4 +1,3 @@
-
 class BinaryTreeNode(object):
     #initial values for value,left and right
     def __init__(self, value):
@@ -36,7 +35,7 @@ def in_order_traversal(tree,a):
         in_order_traversal(tree.right,a)
 
 
-def TreeSort(x):
+def tree_sort(x):
     # root node
     t = insert(None, x[0]);
     # inserting all elements in the binary tree
@@ -46,3 +45,4 @@ def TreeSort(x):
     a = []
     in_order_traversal(t,a)
     return a
+
