Delete Node In BST

You are given the root of a Binary Search Tree (BST) and an integer key. Your task is to delete the node with the given key from the BST while maintaining the BST properties and return the root of the updated tree.

When deleting a node:

• If the node has no children, simply remove it.
• If the node has one child, replace it with its child.
• If the node has two children, replace it with its inorder successor (or predecessor) and maintain the BST structure.

If the key does not exist, return the original tree unchanged.