BST insert and delete | Dataford Interview Questions

What is a BST? Insert and delete a node from a BST (dry-run on a sample BST).

Asked in the Technical interview 1 stage.

Represent each tree node as [value, left, right], where an empty child is null. Implement the function below to insert insert_value, then delete delete_value, and return the resulting tree. Ignore duplicate insertions and leave the tree unchanged if the deletion value is absent.

Function

bst_insert_delete(root, insert_value, delete_value)

Output

Return the resulting nested-list tree representation.

Constraints

The tree uses nested lists in the form [value, left, right].
Each value is an integer.
The input tree is a valid BST with unique values.
The number of nodes is at most 10^4.
insert_value and delete_value are integers.

Function Signature

def bst_insert_delete(root, insert_value, delete_value):

Your question is BST insert and delete. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem