public interface AvlTree<K>
Modifier and Type | Method and Description |
---|---|
LinkedAvlNode<K> |
find(K key)
Find a LinkedAvlNode with the given key value in the tree.
|
LinkedAvlNode<K> |
findGreater(K key)
Finds a LinkedAvlNode whose key is higher than the given key.
|
LinkedAvlNode<K> |
findGreaterOrEqual(K key)
Finds a LinkedAvlNode whose key is higher than the given key.
|
LinkedAvlNode<K> |
findLess(K key)
Finds a LinkedAvlNode whose key is lower than the given key.
|
LinkedAvlNode<K> |
findLessOrEqual(K key)
Finds a LinkedAvlNode whose key is lower than the given key.
|
Comparator<K> |
getComparator() |
LinkedAvlNode<K> |
getFirst() |
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
|
Comparator<K> getComparator()
K insert(K key)
key
- the item to be insertedK remove(K key)
key
- the value of the node to be removedboolean isEmpty()
int getSize()
LinkedAvlNode<K> getRoot()
void printTree()
LinkedAvlNode<K> getFirst()
LinkedAvlNode<K> getLast()
LinkedAvlNode<K> findGreater(K key)
key
- the keyLinkedAvlNode<K> findGreaterOrEqual(K key)
key
- the keyLinkedAvlNode<K> findLess(K key)
key
- the keyLinkedAvlNode<K> findLessOrEqual(K key)
key
- the keyLinkedAvlNode<K> find(K key)
key
- the key to findCopyright © 2003–2020 The Apache Software Foundation. All rights reserved.