Statement unnecessarily nested within else clause.
git-svn-id: https://svn.apache.org/repos/asf/commons/proper/collections/trunk@1635476 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
c611542726
commit
f0b18d27f0
|
@ -865,13 +865,7 @@ public class TreeList<E> extends AbstractList<E> {
|
||||||
s = sAncestor.balance();
|
s = sAncestor.balance();
|
||||||
}
|
}
|
||||||
return s;
|
return s;
|
||||||
} else {
|
}
|
||||||
// CASE 2: This tree is taller. This is symmetric to case 1.
|
|
||||||
// We merge otherTree into this tree by finding a subtree s of this
|
|
||||||
// tree that is of similar height to otherTree and replacing it
|
|
||||||
// with a new subtree whose root is otherTreeMin and whose
|
|
||||||
// children are otherTree and s.
|
|
||||||
|
|
||||||
otherTree = otherTree.removeMin();
|
otherTree = otherTree.removeMin();
|
||||||
|
|
||||||
final ArrayStack<AVLNode<E>> sAncestors = new ArrayStack<AVLNode<E>>();
|
final ArrayStack<AVLNode<E>> sAncestors = new ArrayStack<AVLNode<E>>();
|
||||||
|
@ -907,7 +901,6 @@ public class TreeList<E> extends AbstractList<E> {
|
||||||
}
|
}
|
||||||
return s;
|
return s;
|
||||||
}
|
}
|
||||||
}
|
|
||||||
|
|
||||||
// private void checkFaedelung() {
|
// private void checkFaedelung() {
|
||||||
// AVLNode maxNode = left.max();
|
// AVLNode maxNode = left.max();
|
||||||
|
|
Loading…
Reference in New Issue