|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface AvlTree<K>
The interface for an AVL Tree.
Method Summary | |
---|---|
LinkedAvlNode<K> |
find(K key)
Find a LinkedAvlNode with the given key value in the tree. |
LinkedAvlNode<K> |
findGreater(K key)
Finds a LinkedAvlNode |
LinkedAvlNode<K> |
findGreaterOrEqual(K key)
Finds a LinkedAvlNode |
LinkedAvlNode<K> |
findLess(K key)
Finds a LinkedAvlNode |
LinkedAvlNode<K> |
findLessOrEqual(K key)
Finds a LinkedAvlNode |
java.util.Comparator<K> |
getComparator()
|
LinkedAvlNode<K> |
getFirst()
|
java.util.List<K> |
getKeys()
|
LinkedAvlNode<K> |
getLast()
|
LinkedAvlNode<K> |
getRoot()
|
int |
getSize()
returns the number of nodes present in this tree. |
K |
insert(K key)
Inserts a LinkedAvlNode with the given key. |
boolean |
isEmpty()
Tests if the tree is logically empty. |
void |
printTree()
Prints the contents of AVL tree in pretty format |
K |
remove(K key)
Removes the LinkedAvlNode present in the tree with the given key value |
Method Detail |
---|
java.util.Comparator<K> getComparator()
K insert(K key)
key
- the item to be inserted
K remove(K key)
key
- the value of the node to be removed
boolean isEmpty()
int getSize()
LinkedAvlNode<K> getRoot()
java.util.List<K> getKeys()
void printTree()
LinkedAvlNode<K> getFirst()
LinkedAvlNode<K> getLast()
LinkedAvlNode<K> findGreater(K key)
key
- the key
LinkedAvlNode<K> findGreaterOrEqual(K key)
key
- the key
LinkedAvlNode<K> findLess(K key)
key
- the key
LinkedAvlNode<K> findLessOrEqual(K key)
key
- the key
LinkedAvlNode<K> find(K key)
key
- the key to find
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |