Solution: Delete Nodes And Return Forest
Explore how to delete nodes from a binary tree and return the forest of remaining trees. This lesson teaches you to process each node correctly, manage child nodes when parents are deleted, and implement an efficient tree traversal algorithm. You will understand the time and space trade-offs involved in this process.
We'll cover the following...
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...