give root binary tree node tree distinct valueafter delete node value to_delete leave forest disjoint union treesReturn root tree remain forest you return result order Example 1input root 1234567 to_delete 35output 12null467example 2input root 124null3 to_delete 3Output 124 ConstraintsThe number node give tree 1000each node distinct value 1 1000to_deletelength 1000to_delete contain distinct value 1 1000