Solution: Delete Nodes And Return Forest
Understand how to delete nodes from a binary tree by identifying specified values and transforming the tree into a forest of disjoint trees. Explore the step-by-step algorithm using depth-first search and stack operations, and analyze the time and space complexity to confidently implement this solution.
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 deleteNodes array. 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...