Binary Search Tree-Deletion

whats the importance of using “inorder”, Can’t we delete the node using pre/post order too?

I mean why is the (data==root->data)condition in middle??

PS: This is in reference to the “BST deletion” online video in launchpad course.