Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public E last()
- {
- if (root == null)
- {
- throw new NullPointerException("Set's root is null in "
- + "E last()");
- }
- BstNode<E> node = root;
- while (node.right != null)
- {
- node = node.right;
- }
- return node.element;
- }
- public Set<E> tailSet(E element) {
- Set<E> list = new BstSet();
- if (root != null && element != null) {
- setTailRecursive(element, root, list);
- }
- return list;
- }
- private void setTailRecursive(E element, BstNode<E> node, Set<E> list) {
- if (node != null) {
- if (element.compareTo(node.element) < 0) {
- list.add(node.element);
- }
- setTailRecursive(element, node.right, list);
- setTailRecursive(element, node.left, list);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement