(int i)
| 51 | |
| 52 | // 修正信息 |
| 53 | public static void up(int i) { |
| 54 | size[i] = size[left[i]] + size[right[i]] + count[i]; |
| 55 | height[i] = Math.max(height[left[i]], height[right[i]]) + 1; |
| 56 | } |
| 57 | |
| 58 | // i节点为头的树左旋,返回左旋后头节点的空间编号 |
| 59 | public static int leftRotate(int i) { |
no test coverage detected