A B C D I K L N P R S T

A

AVL - package AVL

AVLTree<Key,Data> - Class in AVL

Implementation of a generic AVL Tree.

AVLTree(Comparator<Key>) - Constructor for class AVL.AVLTree

The constructor.

B

bf - Variable in class AVL.Node

The node's balanceFactor.

C

c - Variable in class AVL.AVLTree

A comparator of Key objects

D

data - Variable in class AVL.Node

The the data stored in the node.

delete(Node<Key, Data>) - Method in class AVL.AVLTree

Removes a node from the tree.

deleteKey(Key) - Method in class AVL.AVLTree

Removes a node with the given key from the tree.

I

insert(Key, Data) - Method in class AVL.AVLTree

Inserts a key and a data item into the tree, creating a new node for this key and data pair.

K

key - Variable in class AVL.Node

The key of the data stored in the node.

L

left - Variable in class AVL.Node

The node's left child.

N

Node<Key,Data> - Class in AVL

The node of an AVL Tree.

Node(Key, Data) - Constructor for class AVL.Node

Node constructot.

P

parent - Variable in class AVL.Node

The node's parent.

print() - Method in class AVL.AVLTree

Prints the whole tree

R

right - Variable in class AVL.Node

The node's right child.

root - Variable in class AVL.AVLTree

Root of the AVL tree.

S

search(Key) - Method in class AVL.AVLTree

Searches the tree for a node with a given key.

search(Node<Key, Data>, Key) - Method in class AVL.AVLTree

Searches the subtree rooted at a given node for a node with a given key.

size - Variable in class AVL.AVLTree

Number of items in the tree

size() - Method in class AVL.AVLTree

The number of elements in the tree.

successor(Node<Key, Data>) - Method in class AVL.AVLTree

Returns the successor of a given node in an inorder walk of the tree.

T

toString() - Method in class AVL.Node

Returns the node as a String.

treeInsert(Node<Key, Data>) - Method in class AVL.AVLTree

Inserts a node into the tree.

treeMinimum(Node<Key, Data>) - Method in class AVL.AVLTree

Returns the node with the minimum key in the subtree rooted at a node.

A B C D I K L N P R S T