From 13c38ec63c14934258d89579c428c3ce3a76391d Mon Sep 17 00:00:00 2001 From: ivan Date: Thu, 2 Jan 2025 04:33:01 -0600 Subject: [PATCH] invert binary tree --- .../invert_binary_tree.py | 24 +++++++++++++++++++ .../test_invert_binary_tree_round_12.py | 19 +++++++++++++++ 2 files changed, 43 insertions(+) create mode 100644 src/my_project/interviews/top_150_questions_round_12/invert_binary_tree.py create mode 100644 tests/test_150_questions_round_12/test_invert_binary_tree_round_12.py diff --git a/src/my_project/interviews/top_150_questions_round_12/invert_binary_tree.py b/src/my_project/interviews/top_150_questions_round_12/invert_binary_tree.py new file mode 100644 index 00000000..dd00f0f4 --- /dev/null +++ b/src/my_project/interviews/top_150_questions_round_12/invert_binary_tree.py @@ -0,0 +1,24 @@ +from typing import List, Union, Collection, Mapping, Optional +from abc import ABC, abstractmethod + +class TreeNode: + def __init__(self, val=0, left=None, right=None): + self.val = val + self.left = left + self.right = right + + +class Solution: + def invertTree(self, root: TreeNode) -> TreeNode: + + try: + root.val + except: + return root + + root.left, root.right = ( + self.invertTree(root.right), + self.invertTree(root.left) + ) + + return root \ No newline at end of file diff --git a/tests/test_150_questions_round_12/test_invert_binary_tree_round_12.py b/tests/test_150_questions_round_12/test_invert_binary_tree_round_12.py new file mode 100644 index 00000000..bc945cd9 --- /dev/null +++ b/tests/test_150_questions_round_12/test_invert_binary_tree_round_12.py @@ -0,0 +1,19 @@ +import unittest +from my_project.interviews.top_150_questions_round_12\ +.invert_binary_tree import Solution, TreeNode + +class InvertTreeTestCase(unittest.TestCase): + + def test_none_inverted_tree(self): + solution = Solution() + tree = None + output = solution.invertTree(root=tree) + self.assertIsNone(output) + + def test_inverted_tree(self): + solution = Solution() + tree = TreeNode(1,TreeNode(2),TreeNode(3)) + output = solution.invertTree(root=tree) + self.assertEqual(1,output.val) + self.assertEqual(2,output.right.val) + self.assertEqual(3,output.left.val)