(Node c)
| 97 | } |
| 98 | |
| 99 | public Node leftRotate(Node c) { |
| 100 | Node p = c.right; |
| 101 | Node t = p.left; |
| 102 | |
| 103 | p.left = c; |
| 104 | c.right = t; |
| 105 | |
| 106 | p.height = Math.max(height(p.left), height(p.right) + 1); |
| 107 | c.height = Math.max(height(c.left), height(c.right) + 1); |
| 108 | |
| 109 | return p; |
| 110 | } |
| 111 | |
| 112 | public void populate(int[] nums) { |
| 113 | for (int i = 0; i < nums.length; i++) { |