##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Maintain BST property
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). The deletion you can divide into two stages:
Search for the node to delete
If found, delete the node Example: Deleting 3 from produces (one valid answer). Constraints: up to nodes, values from to .
