问题记录
- 若二叉排序树中有值相同的节点,将会在search()和searchParent()两个函数中陷入死循环,出现栈溢出异常StackOverflowError。
- 目前的解决办法是,在添加节点时的add()函数中判断要添加的节点值是否已经存在,存在则不再添加相同节点。
- 后续再思考更好的优化方案!
完整代码
public class BinarySortTreeDemo {
public static void main(String[] args) {
int[] arr = {7, 3, 10, 12, 5, 1, 9, 2, 10};
BinarySortTree binarySortTree = new BinarySortTree();
for (int i = 0; i < arr.length; i++) {
binarySortTree.add(new Node(arr[i]));
}
binarySortTree.delNode(12);
binarySortTree.delNode(5);
binarySortTree.delNode(7);
binarySortTree.delNode(1);
System.out.println("中序遍历~~~~~~~~~~~~~~~~~~~~~~");
binarySortTree.infixOrder();
System.out.println("根节点~~~~~~~~~~~~~~~~~~~~~~");
System.out.println(binarySortTree.getRoot());
}
}
class BinarySortTree {
private Node root;
public Node getRoot() {
return root;
}
public Node search(int value) {
if (root == null) {
return null;
} else {
return root.search(value);
}
}
public Node searchParent(int value) {
if (root == null) {
return null;
} else {
return root.searchParent(value);
}
}
public void delNode(int value) {
if (root == null) {
return;
}
Node targetNode = search(value);
if (targetNode == null) {
return;
}
if (root.left == null && root.right == null) {
root = null;
return;
}
Node parentNode = searchParent(value);
if (targetNode.left == null && targetNode.right == null) {
if (parentNode.left != null && parentNode.left.value == value) {
parentNode.left = null;
return;
}
if (parentNode.right != null && parentNode.right.value == value) {
parentNode.right = null;
return;
}
}
if (targetNode.left != null && targetNode.right != null) {
int minValue = delRightTreeMin(targetNode.right);
targetNode.value = minValue;
return;
}
if (targetNode.left != null) {
if (parentNode != null) {
if (parentNode.left != null && parentNode.left.value == value) {
parentNode.left = targetNode.left;
} else if (parentNode.right != null && parentNode.right.value == value) {
parentNode.right = targetNode.left;
}
} else {
root = targetNode.left;
}
} else {
if (parentNode != null) {
if (parentNode.left != null && parentNode.left.value == value) {
parentNode.left = targetNode.right;
} else if (parentNode.right != null && parentNode.right.value == value) {
parentNode.right = targetNode.right;
}
} else {
root = targetNode.right;
}
}
}
public int delRightTreeMin(Node node) {
Node target = node;
while (target.left != null) {
target = target.left;
}
delNode(target.value);
return target.value;
}
public void add(Node node) {
if (root == null) {
root = node;
} else {
root.add(node);
}
}
public void infixOrder() {
if (root != null) {
root.infixOrder();
} else {
System.out.println("二叉排序树为空,不能遍历");
}
}
}
class Node {
int value;
Node left;
Node right;
public Node(int value) {
this.value = value;
}
@Override
public String toString() {
return "Node{" +
"value=" + value +
'}';
}
public Node search(int value) {
if (value == this.value) {
return this;
} else if (value < this.value) {
if (this.left == null) {
return null;
}
return this.left.search(value);
} else {
if (this.right == null) {
return null;
}
return this.right.search(value);
}
}
public Node searchParent(int value) {
if ((this.left != null && this.left.value == value)
|| (this.right != null && this.right.value == value)) {
return this;
} else {
if (value < this.value && this.left != null) {
return this.left.searchParent(value);
} else if (value >= this.value && this.right != null) {
return this.right.searchParent(value);
} else {
return null;
}
}
}
public void add(Node node) {
if (node == null) {
return;
}
Node searchNode = search(node.value);
if (searchNode != null) {
System.out.println("数据值为" + node.value + "的节点已存在,无 法添加!");
return;
}
if (node.value < this.value) {
if (this.left == null) {
this.left = node;
} else {
this.left.add(node);
}
} else {
if (this.right == null) {
this.right = node;
} else {
this.right.add(node);
}
}
}
public void infixOrder() {
if (this.left != null) {
this.left.infixOrder();
}
System.out.println(this);
if (this.right != null) {
this.right.infixOrder();
}
}
}