Java, Binary tree remove method

Question

I am trying to write a remove(node cRoot, Object o) function for a sorted binary tree.

Here is what I have so far:

private boolean remov         


        

Answer 1

1. leaf-delete node
2. 1-child Promote the subtree
3. 2-child case replace the node with either
4. in order successor or predecessor
5. left most of the right subtree or
6. right most of the left subtree