Delete Node in a BST

Input: root = [5,3,6,2,4,null,7], key = 3

Output: [5,4,6,2,null,null,7]

Given key to delete is 3. So we find the node with value 3 and delete it. One valid answer is [5,4,6,2,null,null,7]. Another valid answer is [5,2,6,null,4,null,7].

Input: root = [5,3,6,2,4,null,7], key = 0

Output: [5,3,6,2,4,null,7]

The tree does not contain a node with value = 0, so the tree remains unchanged.

Input: root = [], key = 0

Output: []

The tree is empty, so there is nothing to delete.

Delete Node in a BST

Problem

Constraints

Examples