(Node<T> n,
Cell<Node<T>> ancestors)
| 347 | } |
| 348 | |
| 349 | private static <T> Cell<Node<T>> minimum(Node<T> n, |
| 350 | Cell<Node<T>> ancestors) |
| 351 | { |
| 352 | while (n.left != NullNode) { |
| 353 | n.left = new Node(n.left); |
| 354 | ancestors = new Cell(n, ancestors); |
| 355 | n = n.left; |
| 356 | } |
| 357 | |
| 358 | return new Cell(n, ancestors); |
| 359 | } |
| 360 | |
| 361 | private static <T> Cell<Node<T>> maximum(Node<T> n, |
| 362 | Cell<Node<T>> ancestors) |