mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
629848e372
* fix: fix mypy errors
Update binary_search_tree `arr` argument to be typed as a list
within `find_kth_smallest` function
Update return type of `merge_two_binary_trees` as both inputs can
be None which means that a None type value can be returned from
this function
* updating DIRECTORY.md
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
96 lines
2.3 KiB
Python
96 lines
2.3 KiB
Python
#!/usr/local/bin/python3
|
|
"""
|
|
Problem Description: Given two binary tree, return the merged tree.
|
|
The rule for merging is that if two nodes overlap, then put the value sum of
|
|
both nodes to the new value of the merged node. Otherwise, the NOT null node
|
|
will be used as the node of new tree.
|
|
"""
|
|
from __future__ import annotations
|
|
|
|
from typing import Optional
|
|
|
|
|
|
class Node:
|
|
"""
|
|
A binary node has value variable and pointers to its left and right node.
|
|
"""
|
|
|
|
def __init__(self, value: int = 0) -> None:
|
|
self.value = value
|
|
self.left: Node | None = None
|
|
self.right: Node | None = None
|
|
|
|
|
|
def merge_two_binary_trees(tree1: Node | None, tree2: Node | None) -> Optional[Node]:
|
|
"""
|
|
Returns root node of the merged tree.
|
|
|
|
>>> tree1 = Node(5)
|
|
>>> tree1.left = Node(6)
|
|
>>> tree1.right = Node(7)
|
|
>>> tree1.left.left = Node(2)
|
|
>>> tree2 = Node(4)
|
|
>>> tree2.left = Node(5)
|
|
>>> tree2.right = Node(8)
|
|
>>> tree2.left.right = Node(1)
|
|
>>> tree2.right.right = Node(4)
|
|
>>> merged_tree = merge_two_binary_trees(tree1, tree2)
|
|
>>> print_preorder(merged_tree)
|
|
9
|
|
11
|
|
2
|
|
1
|
|
15
|
|
4
|
|
"""
|
|
if tree1 is None:
|
|
return tree2
|
|
if tree2 is None:
|
|
return tree1
|
|
|
|
tree1.value = tree1.value + tree2.value
|
|
tree1.left = merge_two_binary_trees(tree1.left, tree2.left)
|
|
tree1.right = merge_two_binary_trees(tree1.right, tree2.right)
|
|
return tree1
|
|
|
|
|
|
def print_preorder(root: Node | None) -> None:
|
|
"""
|
|
Print pre-order traversal of the tree.
|
|
|
|
>>> root = Node(1)
|
|
>>> root.left = Node(2)
|
|
>>> root.right = Node(3)
|
|
>>> print_preorder(root)
|
|
1
|
|
2
|
|
3
|
|
>>> print_preorder(root.right)
|
|
3
|
|
"""
|
|
if root:
|
|
print(root.value)
|
|
print_preorder(root.left)
|
|
print_preorder(root.right)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
tree1 = Node(1)
|
|
tree1.left = Node(2)
|
|
tree1.right = Node(3)
|
|
tree1.left.left = Node(4)
|
|
|
|
tree2 = Node(2)
|
|
tree2.left = Node(4)
|
|
tree2.right = Node(6)
|
|
tree2.left.right = Node(9)
|
|
tree2.right.right = Node(5)
|
|
|
|
print("Tree1 is: ")
|
|
print_preorder(tree1)
|
|
print("Tree2 is: ")
|
|
print_preorder(tree2)
|
|
merged_tree = merge_two_binary_trees(tree1, tree2)
|
|
print("Merged Tree is: ")
|
|
print_preorder(merged_tree)
|