← Questions
Delete a node from a binary search tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given the root of a binary search tree and a key, delete the node with that key and return the root, keeping it a valid BST. Handle the cases of a leaf, a node with one child, and a node with two children (replace it with its in-order successor or predecessor).
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding