2038 |
|
return; |
2039 |
|
if (root.parent != null) |
2040 |
|
root = root.root(); |
2041 |
< |
if (root == null || root.right == null || |
2042 |
< |
(rl = root.left) == null || rl.left == null) { |
2041 |
> |
if (root == null |
2042 |
> |
|| (movable |
2043 |
> |
&& (root.right == null |
2044 |
> |
|| (rl = root.left) == null |
2045 |
> |
|| rl.left == null))) { |
2046 |
|
tab[index] = first.untreeify(map); // too small |
2047 |
|
return; |
2048 |
|
} |
2271 |
|
|
2272 |
|
static <K,V> TreeNode<K,V> balanceDeletion(TreeNode<K,V> root, |
2273 |
|
TreeNode<K,V> x) { |
2274 |
< |
for (TreeNode<K,V> xp, xpl, xpr;;) { |
2274 |
> |
for (TreeNode<K,V> xp, xpl, xpr;;) { |
2275 |
|
if (x == null || x == root) |
2276 |
|
return root; |
2277 |
|
else if ((xp = x.parent) == null) { |