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

Solution: Delete Nodes And Return Forest

Explore the process of deleting nodes from a binary tree and returning the resulting forest of disjoint trees. Learn how depth-first search is used to traverse the tree, detach nodes, and identify new roots. Understand the step-by-step algorithm and its time and space complexity to confidently handle similar problems involving tree modifications.

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 ...