Deleting A Node From A BST

I am having an issue deleting a node for a tree for one of the cases.The cases for deleting a node are:

1. if its the root set it to null
2. if its a leaf, have its parent point to null
3. if the node you want to delete does not have a right child, have deleted nodes parent point to delted nodes only child
4. find the nodes predecessor(next largest value), have have predecessor's left child be deletes left, and preds right to be deletes right. then have deletes parent point to pred and finally, delete preds old spot (the one that is giving me an issue, I believe)

The pre order of the tree I am currently on is 50 5 4 10 190 100 100 200 190 201

or------------------50
-------------5--------------190
---------4------10-----100-------200
--------------------100---190--201

I am trying to delete 190 (which should be the first one)but when I try to print out the list after I delete, I get a stack overflow error when I try printing everything out.I am pretty sure that it has something to do with me hooking up the nodes incorrectly since error occurs for case 4, since it prints out just fine when I deleted previous nodes (like a leaf).Here is my delete method: (note, ignore my determineX and checkOtherHalf methods)

public boolean delete (E item) {
if(root == null){
return false;

else if(item == root){
root = null;
return true;

[code]....

I have confirmed that it is a pointer issue: I need to assign replacements old parents left child to null, to stop it, but idk how.Here is a screen shot of it when I debug it