-2
public void insert(int v) {
Node t = root;
int compareResult;
compareResult = 0;
if ((t.getData()).equals(v)) return;
if (t == null) {
Node n = new Node<>(v, t, null, null);
} else
while (t != null) {
compareResult = v.compareTo(t.getData());
if (compareResult > 0) {
if (t.getRight() != null) {
t = t.getRight();
} else {
Node n = t.getRight();
break;
}
}
else {
compareResult = v.compareTo(t.getData());
if (compareResult < 0) {
if (t.getLeft() != null) {
t = t.getLeft();
} else {
Node n = t.getLeft();
break;
}
}
}
}
取代
v.compareTo(t.getData())
你需要更具體 – Colin你需要告訴我們你得到錯誤。 – azurefrog