Update lowest_common_ancestor.py

Author: MaximSmolskiy

data_structures/binary_tree/lowest_common_ancestor.py

@@ -29,7 +29,7 @@ def create_sparse(max_node: int, parent: list[list[int]]) -> list[list[int]]:
     creating sparse table which saves each nodes 2^i-th parent
     >>> max_node = 6
     >>> parent = [[0, 0, 1, 1, 2, 2, 3]] + [[0] * 7 for _ in range(19)]
-    >>> parent = create_sparse(max_node, parent)
+    >>> parent = create_sparse(max_node=max_node, parent=parent)
     >>> parent[0]
     [0, 0, 1, 1, 2, 2, 3]
     >>> parent[1]
@@ -39,7 +39,7 @@ def create_sparse(max_node: int, parent: list[list[int]]) -> list[list[int]]:
 
     >>> max_node = 1
     >>> parent = [[0, 0]] + [[0] * 2 for _ in range(19)]
-    >>> parent = create_sparse(max_node, parent)
+    >>> parent = create_sparse(max_node=max_node, parent=parent)
     >>> parent[0]
     [0, 0]
     >>> parent[1]