Delete Node In A BST · Interview Problem

Leetcode

delete-node-in-a-bst

Medium

Trees

Binary Search Tree

Delete Node In A BST

Delete a node with a given key in a Binary Search Tree and return the root of the modified tree.

Acceptance 67%

Problem Statement

Core description from the backend problem record.

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 of the BST after deletion.

Basically, the deletion can be divided into two stages:

Search for the node to remove.
If the node is found, delete the node and ensure the BST properties are maintained.

Note: The deletion process involves three main cases:

Node to be deleted is a leaf node (no children): Simply remove the node from the tree.
Node to be deleted has only one child: Replace the node with its child.
Node to be deleted has two children: Find the in-order successor (smallest in the right subtree), copy its value to the node to be deleted, and then delete the in-order successor.

Return the root node of the BST after deleting the node with the given key, serialized in the same format as the input.

Loading Preptin