isort --profile black . (#2181)

* updating DIRECTORY.md

* isort --profile black .

* Black after

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>

data_structures/binary_tree/non_recursive_segment_tree.py

@@ -35,7 +35,7 @@ https://www.geeksforgeeks.org/segment-tree-efficient-implementation/
 >>> st.query(0, 2)
 [1, 2, 3]
 """
-from typing import List, Callable, TypeVar
+from typing import Callable, List, TypeVar
 
 T = TypeVar("T")
 

data_structures/binary_tree/segment_tree_other.py

@@ -3,9 +3,8 @@ Segment_tree creates a segment tree with a given array and function,
 allowing queries to be done later in log(N) time
 function takes 2 values and returns a same type value
 """
-
-from queue import Queue
 from collections.abc import Sequence
+from queue import Queue
 
 
 class SegmentTreeNode(object):

data_structures/hashing/double_hash.py

@@ -1,7 +1,6 @@
 #!/usr/bin/env python3
-
 from hash_table import HashTable
-from number_theory.prime_numbers import next_prime, check_prime
+from number_theory.prime_numbers import check_prime, next_prime
 
 
 class DoubleHash(HashTable):

data_structures/hashing/hash_table_with_linked_list.py

@@ -1,6 +1,7 @@
-from hash_table import HashTable
 from collections import deque
 
+from hash_table import HashTable
+
 
 class HashTableWithLinkedList(HashTable):
     def __init__(self, *args, **kwargs):