Tap here to switch tabs
Problem
Submissions

Problem: Delete Nodes And Return Forest

Delete Nodes And Return Forest removes selected values from a binary tree with unique node values and returns the roots of the disjoint trees that remain.

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:

  • 0≤0\leq nodes ≤100\leq100

  • 1≤1\leq nodes.value ≤1000\leq 1000

  • 0≤0\leq delete_nodes.length ≤100\leq 100

  • 1≤1\leq delete_nodes[i] ≤1000\leq 1000

Note: Both nodes and delete_nodes[i] will have distinct values.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Delete Nodes And Return Forest

Delete Nodes And Return Forest removes selected values from a binary tree with unique node values and returns the roots of the disjoint trees that remain.

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:

  • 0≤0\leq nodes ≤100\leq100

  • 1≤1\leq nodes.value ≤1000\leq 1000

  • 0≤0\leq delete_nodes.length ≤100\leq 100

  • 1≤1\leq delete_nodes[i] ≤1000\leq 1000

Note: Both nodes and delete_nodes[i] will have distinct values.