Deleting a node from the Binary Search Tree is a slightly tedious task. Not only do we have to delete the node. But also, we have to make sure the consistency of BST is maintained post-node removal. — For any node n in the BST, the value of the left child of n is less than or equal to the value of n, and the value of the right child of n is greater than the value of n. Mathematically, this can be expressed as: ∀n ∈ T: n.left.key ≤ n.key < n.right.key