fix: Fix pre-commit errors

Author: CaedenPH

Diff for: digital_image_processing/test_digital_image_processing.py

@@ -96,7 +96,7 @@ def test_nearest_neighbour(
 
 
 def test_local_binary_pattern():
-    file_path: str = "digital_image_processing/image_data/lena.jpg"
+    file_path = "digital_image_processing/image_data/lena.jpg"
 
     # Reading the image and converting it to grayscale.
     image = imread(file_path, 0)

Diff for: divide_and_conquer/strassen_matrix_multiplication.py renamed to divide_and_conquer/strassen_matrix_multiplication.py.BROKEN

@@ -24,7 +24,7 @@ def get(self, index: int) -> list:
         return self.sequence[:index]
 
 
-def main():
+def main() -> None:
     print(
         "Fibonacci Series Using Dynamic Programming\n",
         "Enter the index of the Fibonacci number you want to calculate ",

Diff for: dynamic_programming/fibonacci.py

@@ -1,11 +1,12 @@
 from __future__ import annotations
 
+import typing
 from collections.abc import Iterable
 
 import numpy as np
 
-Vector = Iterable[float] | Iterable[int], np.ndarray
-VectorOut = np.float64 | int, float
+Vector = typing.Union[Iterable[float], Iterable[int], np.ndarray]  # noqa: UP007
+VectorOut = typing.Union[np.float64, int, float]  # noqa: UP007
 
 
 def euclidean_distance(vector_1: Vector, vector_2: Vector) -> VectorOut:

Diff for: maths/euclidean_distance.py

@@ -13,11 +13,9 @@ def __init__(self, data):
         self.left = None
 
 
-def build_tree():
+def build_tree() -> TreeNode:
     print("\n********Press N to stop entering at any point of time********\n")
-    check = input("Enter the value of the root node: ").strip().lower() or "n"
-    if check == "n":
-        return None
+    check = input("Enter the value of the root node: ").strip().lower()
     q: queue.Queue = queue.Queue()
     tree_node = TreeNode(int(check))
     q.put(tree_node)
@@ -37,7 +35,7 @@ def build_tree():
         right_node = TreeNode(int(check))
         node_found.right = right_node
         q.put(right_node)
-    return None
+    raise
 
 
 def pre_order(node: TreeNode) -> None:
@@ -272,7 +270,7 @@ def prompt(s: str = "", width=50, char="*") -> str:
     doctest.testmod()
     print(prompt("Binary Tree Traversals"))
 
-    node = build_tree()
+    node: TreeNode = build_tree()
     print(prompt("Pre Order Traversal"))
     pre_order(node)
     print(prompt() + "\n")