human
Can you provide a the Python code you requested given the following:
I found an interesting problem on https://leetcode.com/problems/delete-nodes-and-return-forest/:
Given the root of a binary tree, each node in the tree has a distinct value.
After deleting all nodes with a value in to_delete, we are left with a forest (a disjoint union of trees).
Return the roots of the trees in the remaining forest.  You may return the result in any order.
 
Example 1:

Input: root = [1,2,3,4,5,6,7], to_delete = [3,5]
Output: [[1,2,null,4],[6],[7]]

 
Constraints:

The number of nodes in the given tree is at most 1000.
Each node has a distinct value between 1 and 1000.
to_delete.length <= 1000
to_delete contains distinct values between 1 and 1000.

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python code you requested.

class Solution:
    def delNodes(self, root: TreeNode, to_delete: List[int]) -> List[TreeNode]:
        final_list = []
        def rec(node):
            if node == None:
                return None
            node.left = rec(node.left)
            node.right = rec(node.right)
            if node.val in to_delete:
                if node.left!= None:
                    final_list.append(node.left)
                if node.right!= None:
                    final_list.append(node.right)
                return None
            return node
        rec(root)
        if root.val not in to_delete:
            final_list.append(root)
        return(final_list)