replaced TreeNode for TreeNode utils

i-redbyte · i-redbyte · commit 671326142eca · 2025-02-22T15:34:23.000+03:00
diff --git a/easy/average of levels in binary tree/solution.py b/easy/average of levels in binary tree/solution.py
@@ -1,11 +1,5 @@
 from typing import Optional, List
-
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/balanced binary tree/solution.py b/easy/balanced binary tree/solution.py
@@ -1,12 +1,5 @@
 from typing import Optional
-
-
-# Definition for a binary tree node.
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/binary tree inorder traversal/solution.py b/easy/binary tree inorder traversal/solution.py
@@ -1,12 +1,6 @@
 from typing import List, Optional
 
-
-# Definition for a binary tree node.
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/binary tree paths/solution.py b/easy/binary tree paths/solution.py
@@ -1,11 +1,5 @@
 from typing import Optional, List
-
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/binary tree postorder traversal/solution.py b/easy/binary tree postorder traversal/solution.py
@@ -1,11 +1,5 @@
 from typing import Optional, List
-
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/binary tree preorder traversal/solution.py b/easy/binary tree preorder traversal/solution.py
@@ -1,12 +1,5 @@
 from typing import Optional, List
-
-
-# Definition for a binary tree node.
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/binary tree tilt/solution.py b/easy/binary tree tilt/solution.py
@@ -1,12 +1,5 @@
-# Definition for a binary tree node.
 from typing import Optional
-
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/construct string from binary tree/solution.py b/easy/construct string from binary tree/solution.py
@@ -1,11 +1,5 @@
 from typing import Optional
-
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/convert sorted array to binary search tree/solution.py b/easy/convert sorted array to binary search tree/solution.py
@@ -1,12 +1,5 @@
 from typing import Optional, List
-
-
-# Definition for a binary tree node.
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/count complete tree nodes/solution.py b/easy/count complete tree nodes/solution.py
@@ -1,11 +1,5 @@
 from typing import Optional
-
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/increasing order search tree/solution.py b/easy/increasing order search tree/solution.py
@@ -1,10 +1,4 @@
-
-# Definition for a binary tree node.
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode, printTree
 
 
 class Solution:
@@ -23,13 +17,6 @@ def inorder(root, new_tree):
         return new_tree.right
 
 
-def printTree(node: TreeNode, level=0):
-    if node is not None:
-        printTree(node.left, level + 1)
-        print(' ' * 4 * level + '->', node.val)
-        printTree(node.right, level + 1)
-
-
 s = Solution()
 testTree = TreeNode(5, TreeNode(1), TreeNode(7))
 printTree(testTree)
diff --git a/easy/invert binary tree/solution.py b/easy/invert binary tree/solution.py
@@ -1,11 +1,5 @@
 from typing import Optional
-
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode, printTree
 
 
 class Solution:
@@ -33,13 +27,6 @@ def invertTree1(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
         return root
 
 
-def printTree(node: TreeNode, level=0):
-    if node is not None:
-        printTree(node.left, level + 1)
-        print(' ' * 4 * level + '->', node.val)
-        printTree(node.right, level + 1)
-
-
 s = Solution()
 t = TreeNode(2, TreeNode(1), TreeNode(3))
 printTree(t)
diff --git a/easy/maximum depth of binary tree/solution.py b/easy/maximum depth of binary tree/solution.py
@@ -1,13 +1,6 @@
-# Definition for a binary tree node.
 from collections import deque
 from typing import Optional
-
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/minimum depth of binary tree/solution.py b/easy/minimum depth of binary tree/solution.py
@@ -1,13 +1,5 @@
-# Definition for a binary tree node.
-from collections import deque
 from typing import Optional
-
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/path sum/solution.py b/easy/path sum/solution.py
@@ -1,12 +1,6 @@
-# Definition for a binary tree node.
 from typing import Optional
 
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/range sum of BST/solution.py b/easy/range sum of BST/solution.py
@@ -1,12 +1,6 @@
-# Definition for a binary tree node.
 from typing import Optional
 
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/same tree/solution.py b/easy/same tree/solution.py
@@ -1,14 +1,7 @@
-# Definition for a binary tree node.
+from utils import TreeNode
 from typing import Optional
 
 
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
-
-
 class Solution:
     def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
         if p and q:
diff --git a/easy/sum of left leaves/solution.py b/easy/sum of left leaves/solution.py
@@ -1,12 +1,5 @@
 from typing import Optional
-
-
-# Definition for a binary tree node.
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/sum of root to leaf binary numbers/solution.py b/easy/sum of root to leaf binary numbers/solution.py
@@ -1,12 +1,5 @@
 from typing import Optional
-
-
-# Definition for a binary tree node.
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/easy/symmetric tree/solution.py b/easy/symmetric tree/solution.py
@@ -1,12 +1,5 @@
 from typing import Optional
-
-
-# Definition for a binary tree node.
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/hard/recover a tree from preorder traversal/solution.py b/hard/recover a tree from preorder traversal/solution.py
@@ -1,11 +1,6 @@
 from typing import Optional
 
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode, printTree
 
 
 class Solution:
@@ -41,13 +36,6 @@ def getNextNumberAndDepth(s: str, index: int) -> (int, int, int):
         return stack[0]
 
 
-def printTree(node: TreeNode, level=0):
-    if node is not None:
-        printTree(node.left, level + 1)
-        print(' ' * 4 * level + '->', node.val)
-        printTree(node.right, level + 1)
-
-
 s = Solution()
 printTree(s.recoverFromPreorder("1-2--3--4-5--6--7"))
 printTree(s.recoverFromPreorder("1-2--3---4-5--6---7"))
diff --git a/hard/vertical order traversal of a binary tree/solution.py b/hard/vertical order traversal of a binary tree/solution.py
@@ -1,12 +1,6 @@
 from collections import defaultdict
 from typing import Optional, List
-
-
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/medium/binary tree right side view/solution.py b/medium/binary tree right side view/solution.py
@@ -1,10 +1,4 @@
-# Definition for a binary tree node.
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
-
+from utils import TreeNode
 
 from typing import Optional, List
 
diff --git a/medium/convert sorted list to binary search tree/solution.py b/medium/convert sorted list to binary search tree/solution.py
@@ -1,26 +1,6 @@
 # Definition for singly-linked list.
 from typing import Optional
-
-
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
-
-
-# Definition for a binary tree node.
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
-
-
-def printTree(node: TreeNode, level=0):
-    if node is not None:
-        printTree(node.left, level + 1)
-        print(' ' * 4 * level + '->', node.val)
-        printTree(node.right, level + 1)
+from utils import TreeNode, printTree, ListNode
 
 
 def get_middle(head: ListNode) -> ListNode:
diff --git a/medium/count good nodes in binary tree/solution.py b/medium/count good nodes in binary tree/solution.py
@@ -1,8 +1,4 @@
-class TreeNode:
-    def __init__(self, val=0, left=None, right=None):
-        self.val = val
-        self.left = left
-        self.right = right
+from utils import TreeNode
 
 
 class Solution:
diff --git a/medium/deepest leaves sum/solution.py b/medium/deepest leaves sum/solution.py
diff --git a/medium/delete node in a BST/solution.py b/medium/delete node in a BST/solution.py
diff --git a/medium/flatten binary tree to linked list/solution.py b/medium/flatten binary tree to linked list/solution.py
diff --git a/medium/house robber III/solution.py b/medium/house robber III/solution.py
diff --git a/medium/kth smallest element in a bst/solution.py b/medium/kth smallest element in a bst/solution.py
diff --git a/medium/path sum II/solution.py b/medium/path sum II/solution.py
diff --git a/medium/recover binary search tree/solution.py b/medium/recover binary search tree/solution.py
diff --git a/medium/sum root to leaf numbers/solution.py b/medium/sum root to leaf numbers/solution.py
diff --git a/medium/validate binary search tree/solution.py b/medium/validate binary search tree/solution.py
diff --git a/utils.py b/utils.py
