update some about tree

Author: EINDEX

Diff for: Pipfile

@@ -0,0 +1,11 @@
+[[source]]
+url = "https://pypi.python.org/simple"
+verify_ssl = true
+name = "pypi"
+
+[packages]
+
+[dev-packages]
+
+[requires]
+python_version = "3.6"

Diff for: Pipfile.lock

@@ -34,18 +34,18 @@ def wrapper(*args, **kw):
 class TestSearch(TestCase):
     @search_log
     def test_linear_search(self, arr, key):
-        from Search.linear_search import linear_search
+        from search.linear_search import linear_search
         if not key == linear_search(arr, key):
             self.fail()
 
     @search_log
     def test_binary_search_while(self, arr, key):
-        from Search.binary_search import binary_search_while
+        from search.binary_search import binary_search_while
         if not key == binary_search_while(arr, key):
             self.fail()
 
     @search_log
     def test_binary_search_re(self, arr, key):
-        from Search.binary_search import binary_search_re
+        from search.binary_search import binary_search_re
         if not key == binary_search_re(arr, key):
             self.fail()

Diff for: DataStructure/Linear/__init__.py renamed to algorithm/__init__.py

@@ -39,61 +39,61 @@ def wrapper(*args, **kw):
 class TestSort(TestCase):
     @log_sort
     def test_bubble_sort(self, arr):
-        from Sort.bubble_sort import bubble_sort
+        from sort.bubble_sort import bubble_sort
         if not sorted(arr) == bubble_sort(arr):
             self.fail()
 
     @log_sort
     def test_bubble_sort_flag(self, arr):
-        from Sort.bubble_sort import bubble_sort_flag
+        from sort.bubble_sort import bubble_sort_flag
         if not sorted(arr) == bubble_sort_flag(arr):
             self.fail()
 
     @log_sort
     def test_heap_sort(self, arr):
-        from Sort.heap_sort import heap_sort
+        from sort.heap_sort import heap_sort
         if not sorted(arr) == heap_sort(arr):
             self.fail()
 
     @log_sort
     def test_insert_sort(self, arr):
-        from Sort.insert_sort import insert_sort
+        from sort.insert_sort import insert_sort
         if not sorted(arr) == insert_sort(arr):
             self.fail()
 
     @log_sort
     def test_merge_sort(self, arr):
-        from Sort.marge_sort import merge_sort
+        from sort.marge_sort import merge_sort
         if not sorted(arr) == merge_sort(arr):
             self.fail()
 
     @log_sort
     def test_quick_sort(self, arr):
-        from Sort.quick_sort import quick_sort
+        from sort.quick_sort import quick_sort
         if not sorted(arr) == quick_sort(arr):
             self.fail()
 
     @log_sort
     def test_quick_sort_cookbook(self, arr):
-        from Sort.quick_sort import quick_sort_cookbook
+        from sort.quick_sort import quick_sort_cookbook
         if not sorted(arr) == quick_sort_cookbook(arr):
             self.fail()
 
     @log_sort
     def test_selection_sort(self, arr):
-        from Sort.selection_sort import selection_sort
+        from sort.selection_sort import selection_sort
         if not sorted(arr) == selection_sort(arr):
             self.fail()
 
     @log_sort
     def test_shell_sort(self, arr):
-        from Sort.shell_sort import shell_sort
+        from sort.shell_sort import shell_sort
         if not sorted(arr) == shell_sort(arr):
             self.fail()
 
     @log_sort
     def test_count_sort(self, arr):
-        from Sort.count_sort import count_sort
+        from sort.count_sort import count_sort
         if len(arr) == 0:
             if not sorted(arr) == count_sort(arr):
                 self.fail()

Diff for: DataStructure/__init__.py renamed to algorithm/search/__init__.py

@@ -1,4 +1,4 @@
-from DataStructure.tree.Tree import Tree
+from data_structure.tree.Tree import Tree
 
 
 class BinaryTree(Tree):