Solution: Delete Nodes And Return Forest
Let’s solve the Delete Nodes And Return Forest problem using the Tree Depth-first Search pattern.
We'll cover the following...
Statement
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:
nodes...