let X is root, it's inorder successive is Y ===> X < Y.
If i delete X, then Y is the Root.
Now i want to insert a element Z which is less than Y and grater than X, then it is placed in right subtree of Y.
Note that in this process, the root is Y
let X is root, it's inorder successive is Y ===> X < Y.
Now i want to insert a element Z which is less than Y and grater than X, then it is placed left of Y.
∴ Now inorder successive is Z.
If i delete X, then Z is the Root.
Hence, " Are deletion and insertion commutative in nature for BST ? " ---- NO