二叉树的删除原代码

public boolean delete(int key) {
Node current = root;
Node parent = null;
boolean isLeftChild = false;


while (current.data != key) {
parent = current;
if (key < current.data) {
current = current.leftChild;
isLeftChild = true;
} else {
current = current.rightChild;
isLeftChild = false;
}
}


if (current == null) {
return false;
}


/** 无子节点 */
if (current.leftChild == null && current.rightChild == null) {
if (current == root) {
root = null;
} else if (isLeftChild) {
parent.leftChild = null;
} else {
parent.rightChild = null;
}
}
/** 仅有右节点 */
else if ((current.leftChild == null && current.rightChild != null)) {
if (current == root) {
root = current.rightChild;
} else if (isLeftChild) {
parent.leftChild = current.rightChild;
} else {
parent.rightChild = current.rightChild;
}
} else if ((current.leftChild != null && current.rightChild == null)) {
if (current == root) {
root = null;
} else if (isLeftChild) {
parent.leftChild = current.leftChild;
} else {
parent.rightChild = current.leftChild;
}
}
return true;
}