Given the root of a binary tree where each node has a unique value, your task is to delete all nodes with values specified in the delete_nodes list. After performing the deletions, the tree will split into a forest—a collection of disjoint trees. Return the roots of the remaining trees in the forest in any order.

Constraints:

• $0\leq$ nodes $\leq100$

• $1\leq$ nodes.value $\leq 1000$

• $0\leq$ delete_nodes.length $\leq 100$

• $1\leq$ delete_nodes[i] $\leq 1000$

Note: Both nodes and delete_nodes[i] will have distinct values.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the problem correctly:

We have a game for you to play. Rearrange the logical building blocks to better understand how to solve this problem.

Implement your solution in the following coding playground.