BST - Delete Node & Inorder Traversal

Number of nodes (N):

Values to insert (space separated):

Key to delete (must exist):

BST Deletion Cases:
1. Node has no children → remove directly
2. Node has one child → replace with child
3. Node has two children → replace with inorder successor

After deletion, the tree remains a valid BST