Merge pull request #111 from BrianLusina/feat/lowest-common-ancestor

Lowest common ancestor of binary tree nodes

Author: BrianLusina

DIRECTORY.md

@@ -284,11 +284,13 @@
         * [Test Binary Search Tree Delete Node](https://github.com/BrianLusina/PythonSnips/blob/master/datastructures/trees/binary/search_tree/test_binary_search_tree_delete_node.py)
         * [Test Binary Search Tree Insert](https://github.com/BrianLusina/PythonSnips/blob/master/datastructures/trees/binary/search_tree/test_binary_search_tree_insert.py)
         * [Test Binary Search Tree Search](https://github.com/BrianLusina/PythonSnips/blob/master/datastructures/trees/binary/search_tree/test_binary_search_tree_search.py)
+      * [Test Utils](https://github.com/BrianLusina/PythonSnips/blob/master/datastructures/trees/binary/test_utils.py)
       * Tree
         * [Test Binary Tree](https://github.com/BrianLusina/PythonSnips/blob/master/datastructures/trees/binary/tree/test_binary_tree.py)
         * [Test Binary Tree Deserialize](https://github.com/BrianLusina/PythonSnips/blob/master/datastructures/trees/binary/tree/test_binary_tree_deserialize.py)
         * [Test Binary Tree Serialize](https://github.com/BrianLusina/PythonSnips/blob/master/datastructures/trees/binary/tree/test_binary_tree_serialize.py)
         * [Test Binary Tree Visible Nodes](https://github.com/BrianLusina/PythonSnips/blob/master/datastructures/trees/binary/tree/test_binary_tree_visible_nodes.py)
+      * [Utils](https://github.com/BrianLusina/PythonSnips/blob/master/datastructures/trees/binary/utils.py)
     * Btree
       * [Node](https://github.com/BrianLusina/PythonSnips/blob/master/datastructures/trees/btree/node.py)
     * Heaps

algorithms/arrays/two_sum_less_k/test_two_sum.py

@@ -5,7 +5,7 @@
 class TwoSumLessKTestCase(unittest.TestCase):
     def test_1(self):
         """numbers = [4,2,11,2,5,3,5,8], target = 7"""
-        numbers = [4,2,11,2,5,3,5,8]
+        numbers = [4, 2, 11, 2, 5, 3, 5, 8]
         target = 7
         expected = 6
         actual = two_sum_less_than_k(numbers, target)
@@ -21,23 +21,23 @@ def test_2(self):
 
     def test_3(self):
         """numbers = [34,23,1,24,75,33,54,8], k = 60"""
-        numbers = [34,23,1,24,75,33,54,8]
+        numbers = [34, 23, 1, 24, 75, 33, 54, 8]
         k = 60
         expected = 58
         actual = two_sum_less_than_k(numbers, k)
         self.assertEqual(expected, actual)
 
     def test_4(self):
         """numbers = [5,5,5,5,5,5], k = 15"""
-        numbers = [5,5,5,5,5,5]
+        numbers = [5, 5, 5, 5, 5, 5]
         k = 15
         expected = 10
         actual = two_sum_less_than_k(numbers, k)
         self.assertEqual(expected, actual)
 
     def test_5(self):
         """numbers = [1,2,3,4,5], k = 3"""
-        numbers = [1,2,3,4,5]
+        numbers = [1, 2, 3, 4, 5]
         k = 3
         expected = -1
         actual = two_sum_less_than_k(numbers, k)

algorithms/search/binary_search/maxruntime_n_computers/__init__.py

@@ -49,7 +49,6 @@ def can_run_for(batteries: List[int], n: int, target_time: int) -> bool:
 
 
 def max_run_time_2(batteries: List[int], n: int) -> int:
-
     """
     Finds the maximum runtime that can power the computers for the given amount of time.
 
@@ -67,7 +66,7 @@ def max_run_time_2(batteries: List[int], n: int) -> int:
         usable = sum(min(b, mid) for b in batteries)
 
         if usable >= mid * n:
-          left = mid
+            left = mid
         else:
-          right = mid - 1
+            right = mid - 1
     return left

algorithms/search/binary_search/maxruntime_n_computers/test_max_runtime.py

@@ -4,35 +4,38 @@
 
 
 class MaxRunTimeTestCase(unittest.TestCase):
-
-    @parameterized.expand([
-        ([2,3,3,4], 3, 4),
-        ([1,1,4,5], 2, 5),
-        ([2,2,2,2], 1, 8),
-        ([7,2,5,10,8], 2, 16),
-        ([1,2,3,4,5], 2, 7),
-        ([3,4,3,4,5,5,8,2], 4, 8),
-        ([5,2,4], 2, 5),
-        ([1,6,2,6,8], 5, 1)
-    ])
+    @parameterized.expand(
+        [
+            ([2, 3, 3, 4], 3, 4),
+            ([1, 1, 4, 5], 2, 5),
+            ([2, 2, 2, 2], 1, 8),
+            ([7, 2, 5, 10, 8], 2, 16),
+            ([1, 2, 3, 4, 5], 2, 7),
+            ([3, 4, 3, 4, 5, 5, 8, 2], 4, 8),
+            ([5, 2, 4], 2, 5),
+            ([1, 6, 2, 6, 8], 5, 1),
+        ]
+    )
     def test_max_runtime_1(self, batteries, n, expected):
         actual = max_runtime(batteries, n)
         self.assertEqual(expected, actual)
 
-    @parameterized.expand([
-        ([2,3,3,4], 3, 4),
-        ([1,1,4,5], 2, 5),
-        ([2,2,2,2], 1, 8),
-        ([7,2,5,10,8], 2, 16),
-        ([1,2,3,4,5], 2, 7),
-        ([3,4,3,4,5,5,8,2], 4, 8),
-        ([5,2,4], 2, 5),
-        ([1,6,2,6,8], 5, 1)
-    ])
+    @parameterized.expand(
+        [
+            ([2, 3, 3, 4], 3, 4),
+            ([1, 1, 4, 5], 2, 5),
+            ([2, 2, 2, 2], 1, 8),
+            ([7, 2, 5, 10, 8], 2, 16),
+            ([1, 2, 3, 4, 5], 2, 7),
+            ([3, 4, 3, 4, 5, 5, 8, 2], 4, 8),
+            ([5, 2, 4], 2, 5),
+            ([1, 6, 2, 6, 8], 5, 1),
+        ]
+    )
     def test_max_runtime_2(self, batteries, n, expected):
         actual = max_run_time_2(batteries, n)
         self.assertEqual(expected, actual)
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     unittest.main()

datascience/numeric_python/statistics/TestChecker.py

@@ -8,8 +8,8 @@ def __init__(self, n):
     @staticmethod
     def test_function(actual, expected):
         print
-        "Test for " + str(
-            actual
-        ) + " passed " if actual == expected else "Test for " + str(
-            actual
-        ) + " failed, expected " + str(expected)
+        (
+            "Test for " + str(actual) + " passed "
+            if actual == expected
+            else "Test for " + str(actual) + " failed, expected " + str(expected)
+        )

datastructures/__init__.py

@@ -1,6 +1,3 @@
 from datastructures.sets import DisjointSetUnion, UnionFind
 
-__all__ = [
-    "DisjointSetUnion",
-    "UnionFind"
-]
+__all__ = ["DisjointSetUnion", "UnionFind"]

datastructures/lists/is_sorted_how/__init__.py

@@ -15,9 +15,7 @@ def is_sorted_and_how_2(arr):
     return (
         "yes, ascending"
         if is_sorted_with(arr, operator.le)
-        else "yes, descending"
-        if is_sorted_with(arr, operator.ge)
-        else "no"
+        else "yes, descending" if is_sorted_with(arr, operator.ge) else "no"
     )
 
 

datastructures/sets/union_find/__init__.py

@@ -47,7 +47,7 @@ def get_count(self) -> int:
 
 class UnionFind:
     """A minimal Union-Find data structure with path compression."""
-    
+
     def __init__(self, size: int):
         """Initializes the data structure with 'size' elements."""
         if size <= 0:
@@ -71,4 +71,4 @@ def union(self, x: int, y: int) -> bool:
         if root_x != root_y:
             self.parent[root_y] = root_x
             return True
-        return False
+        return False

datastructures/streams/stream_checker/__init__.py

@@ -4,7 +4,6 @@
 
 
 class StreamChecker(object):
-
     def __init__(self, words: List[str]):
         """
         Initializes a StreamChecker instance.

datastructures/streams/stream_checker/test_stream_checker.py

@@ -31,5 +31,5 @@ def test_3(self):
         self.assertFalse(stream.query("b"))
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     unittest.main()