169. Leetcode 968. 监控二叉树 (贪心算法-交叉类题目)

 
# 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
class Solution:
def minCameraCover(self, root: TreeNode) -> int:
result = 0
def traversal(cur):
nonlocal result
if not cur:return 2
left = traversal(cur.left)
right = traversal(cur.right)

169. Leetcode 968. 监控二叉树 (贪心算法-交叉类题目)最先出现在Python成神之路。