在python中查找非二进制树的高度和深度

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.children = []

def get_tree_height_depth(root):
    if not root:
        return 0
    
    max_depth = 0
    for child in root.children:
        max_depth = max(max_depth, get_tree_height_depth(child))
    
    return max_depth + 1

# 构建一个非二进制树
root = TreeNode(1)
node2 = TreeNode(2)
node3 = TreeNode(3)
node4 = TreeNode(4)
node5 = TreeNode(5)

root.children = [node2, node3]
node2.children = [node4]
node3.children = [node5]

# 计算树的高度和深度
height = get_tree_height_depth(root)
print("树的高度为:", height)

class TreeNode:
    def __init__(self, value):
        self.value = value
        self.children = []

def get_tree_height_depth(root):
    if not root:
        return 0
    
    stack = [(root, 1)]
    max_depth = 0
    
    while stack:
        node, depth = stack.pop()
        max_depth = max(max_depth, depth)
        
        for child in node.children:
            stack.append((child, depth + 1))
    
    return max_depth

# 构建一个非二进制树
root = TreeNode(1)
node2 = TreeNode(2)
node3 = TreeNode(3)
node4 = TreeNode(4)
node5 = TreeNode(5)

root.children = [node2, node3]
node2.children = [node4]
node3.children = [node5]

# 计算树的高度和深度
height = get_tree_height_depth(root)
print("树的高度为:", height)