Python实现二叉树

class Node:
    def __init__(self, value):
        self.value = value
        self.left = None
        self.right = None

def insert_node(root, value):
    if root is None:
        return Node(value)
    elif value < root.value:
        root.left = insert_node(root.left, value)
    else:
        root.right = insert_node(root.right, value)
    return root

def search_node(root, value):
    if root is None or root.value == value:
        return root
    elif value < root.value:
        return search_node(root.left, value)
    else:
        return search_node(root.right, value)

def print_tree(root):
    if root is not None:
        print_tree(root.left)
        print(root.value, end=" ")
        print_tree(root.right)

root = None
root = insert_node(root, 10)
root = insert_node(root, 5)
root = insert_node(root, 15)
root = insert_node(root, 8)

print("In-order traversal of the binary tree: ", end="")
print_tree(root)
print()

search_result = search_node(root, 8)
if search_result is not None:
    print("Node with value 8 found in the binary tree.")
else:
    print("Node with value 8 not found in the binary tree.")