| Constructor and Description |
|---|
KeyedSet.ReverseTreeIterator() |
protected KeyedSet<K,T> loopTraversal(KeyedSet<K,T> node)
if (node.right != EMPTY) {
traversal(node.right);
}
yield node.member;
if (node.left != EMPTY) {
traversal(node.left);
}
node - top of tree or last node returnedpublic boolean hasNext()
Copyright © 2015. All rights reserved.