Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Delete Nodes And Return Forest

Explore how to delete nodes from a binary tree based on a given list and return the resulting forest of disjoint trees. Learn to apply DFS to traverse the tree, handle node deletions, and manage disconnected subtrees efficiently. This lesson helps you understand transforming tree structures and optimizing the process with time and space complexity in mind.

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:

  • 0≤0\leq nodes ≤100\leq100 ...