Show all steps-python

Review the following BST and create the inorder, preorder and postorder list.

Follow both algorithms. If the node has a left child and a right child, 1) replace the nodes value with the largest value in the left subtree and delete that values node from the left subtree.

Or 2) replace the nodes value with the smallest value in the right subtree and delete that values node from the right subtree.

-What are the two possible values for deleting the root value, 50?

-After deleting the value 72 in the following BST, list the values in preorder traversal.