[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

data_structures/binary_tree/build_tree_from_traversal.py

@@ -17,8 +17,9 @@ def inorder(root, out):
 
 
 # === Build tree using PREORDER + INORDER ===
-def build_tree_from_pre(preorder, pre_start, pre_end,
-                        inorder_seq, in_start, in_end, in_map):
+def build_tree_from_pre(
+    preorder, pre_start, pre_end, inorder_seq, in_start, in_end, in_map
+):
     """Recursive helper to build tree from preorder and inorder traversal."""
     if pre_start > pre_end or in_start > in_end:
         return None
@@ -33,12 +34,24 @@ def build_tree_from_pre(preorder, pre_start, pre_end,
 
     # Recursively build left and right subtrees
     root.left = build_tree_from_pre(
-        preorder, pre_start + 1, pre_start + nums_left,
-        inorder_seq, in_start, in_root_index - 1, in_map)
+        preorder,
+        pre_start + 1,
+        pre_start + nums_left,
+        inorder_seq,
+        in_start,
+        in_root_index - 1,
+        in_map,
+    )
 
     root.right = build_tree_from_pre(
-        preorder, pre_start + nums_left + 1, pre_end,
-        inorder_seq, in_root_index + 1, in_end, in_map)
+        preorder,
+        pre_start + nums_left + 1,
+        pre_end,
+        inorder_seq,
+        in_root_index + 1,
+        in_end,
+        in_map,
+    )
 
     return root
 
@@ -47,13 +60,20 @@ def build_tree_pre(inorder_seq, preorder_seq):
     """Wrapper function for building tree from preorder + inorder."""
     in_map = {val: i for i, val in enumerate(inorder_seq)}
     return build_tree_from_pre(
-        preorder_seq, 0, len(preorder_seq) - 1,
-        inorder_seq, 0, len(inorder_seq) - 1, in_map)
+        preorder_seq,
+        0,
+        len(preorder_seq) - 1,
+        inorder_seq,
+        0,
+        len(inorder_seq) - 1,
+        in_map,
+    )
 
 
 # === Build tree using POSTORDER + INORDER ===
-def build_tree_from_post(postorder, post_start, post_end,
-                         inorder_seq, in_start, in_end, in_map):
+def build_tree_from_post(
+    postorder, post_start, post_end, inorder_seq, in_start, in_end, in_map
+):
     """Recursive helper to build tree from postorder and inorder traversal."""
     if post_start > post_end or in_start > in_end:
         return None
@@ -68,12 +88,24 @@ def build_tree_from_post(postorder, post_start, post_end,
 
     # Recursively build left and right subtrees
     root.left = build_tree_from_post(
-        postorder, post_start, post_start + nums_left - 1,
-        inorder_seq, in_start, in_root_index - 1, in_map)
+        postorder,
+        post_start,
+        post_start + nums_left - 1,
+        inorder_seq,
+        in_start,
+        in_root_index - 1,
+        in_map,
+    )
 
     root.right = build_tree_from_post(
-        postorder, post_start + nums_left, post_end - 1,
-        inorder_seq, in_root_index + 1, in_end, in_map)
+        postorder,
+        post_start + nums_left,
+        post_end - 1,
+        inorder_seq,
+        in_root_index + 1,
+        in_end,
+        in_map,
+    )
 
     return root
 
@@ -82,8 +114,14 @@ def build_tree_post(inorder_seq, postorder_seq):
     """Wrapper function for building tree from postorder + inorder."""
     in_map = {val: i for i, val in enumerate(inorder_seq)}
     return build_tree_from_post(
-        postorder_seq, 0, len(postorder_seq) - 1,
-        inorder_seq, 0, len(inorder_seq) - 1, in_map)
+        postorder_seq,
+        0,
+        len(postorder_seq) - 1,
+        inorder_seq,
+        0,
+        len(inorder_seq) - 1,
+        in_map,
+    )
 
 
 # === Example ===