(Node<T> n)
| 174 | } |
| 175 | |
| 176 | private static <T> Node<T> rightRotate(Node<T> n) { |
| 177 | Node<T> child = new Node(n.left); |
| 178 | n.left = child.right; |
| 179 | child.right = n; |
| 180 | return child; |
| 181 | } |
| 182 | |
| 183 | public PersistentSet<T> remove(T value) { |
| 184 | Path<T> p = find(value); |