完全二叉树最小路径和代码
时间: 2024-04-30 11:16:06 浏览: 14
完全二叉树最小路径和是指从根节点到叶子节点的路径上所有节点值的和的最小值。下面是一个示例代码实现:
```python
class TreeNode:
def __init__(self, val=0, left=None, right=None):
self.val = val
self.left = left
self.right = right
def minPathSum(root):
if not root:
return 0
if not root.left and not root.right:
return root.val
left_sum = minPathSum(root.left)
right_sum = minPathSum(root.right)
return root.val + min(left_sum, right_sum)
# 示例用法
# 构建一个完全二叉树
root = TreeNode(1)
root.left = TreeNode(2)
root.right = TreeNode(3)
root.left.left = TreeNode(4)
root.left.right = TreeNode(5)
root.right.left = TreeNode(6)
root.right.right = TreeNode(7)
result = minPathSum(root)
print("最小路径和为:", result)
```