need answer for both problems in java

1. If node w of Binary Search Tree to be deleted has two children, could node w be simply repliced with one of its children? Why are we looking for the left-most element in the right sub-tree? Is there any other candidate element to replace w? Explain! 2. Show what a Binary Search Tree (that was initially empty) would be after each of the following operations (i.e. show the tree each time an item is inserted or deleted): insert (9), insert( 7), insert (11), insert (6), insert (8), insert (2), insert( 13)