【leetcode】-450. Delete Node in a BST删除BST中一个结点

题目

Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.

Basically, the deletion can be divided into two stages:

Search for a node to remove.
If the node is found, delete the node.
Note: Time complexity should be O(height of tree).

Example:

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

5
/ \
3   6
/ \   \
2   4   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], shown in the following BST.

5
/ \
4   6
/     \
2       7

Another valid answer is [5,2,6,null,4,null,7].

 5
/ \
2   6
\   \
4   7

递归

BST/二叉树技巧：1、先处理当前结点的情况，其他的交给递归框架完成；2、如果当前结点对下面的子结点有整体影响，可以通过辅助函数增长参数列表&#