|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES All Classes | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectjmetal.util.avl.AvlTree<T>
public class AvlTree<T>
Created with IntelliJ IDEA. User: Antonio J. Nebro Date: 08/07/13 Time: 15:51 Class implementing Avl trees.
Constructor Summary | |
---|---|
AvlTree(java.util.Comparator comparator_)
Constructor |
Method Summary | |
---|---|
boolean |
AvlIsEmpty()
|
int |
compareNodes(AvlNode node1,
AvlNode node2)
Comparator |
void |
delete(T item)
|
void |
deleteLeafNode(AvlNode<T> node)
|
void |
deleteNode(AvlNode<T> node)
|
void |
deleteNodeWithALeftChild(AvlNode<T> node)
|
void |
deleteNodeWithARightChild(AvlNode<T> node)
|
void |
doubleLeftRotation(AvlNode<T> node)
|
void |
doubleRightRotation(AvlNode<T> node)
|
AvlNode<T> |
findSuccessor(AvlNode<T> node)
|
int |
getBalance(AvlNode<T> node)
|
AvlNode<T> |
getTop()
|
int |
height(AvlNode<T> node)
|
void |
insert(T item)
|
void |
insertAvlNode(AvlNode node)
|
void |
insertNodeLeft(AvlNode<T> node)
Insert node in the left of its nearest node |
void |
insertNodeRight(AvlNode<T> node)
Insert node in the right of its nearest node |
void |
insertTop(AvlNode node)
|
void |
leftRotation(AvlNode<T> node)
|
void |
rebalance(AvlNode<T> node)
|
void |
rightRotation(AvlNode<T> node)
|
AvlNode<T> |
search(T item)
|
int |
searchClosestNode(AvlNode node)
Searches for the closest node of the node passed as argument |
AvlNode<T> |
searchNode(AvlNode<T> targetNode)
|
void |
setTop(AvlNode<T> top)
|
java.lang.String |
toString()
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public AvlTree(java.util.Comparator comparator_)
comparator_
- Method Detail |
---|
public void insert(T item)
public void insertAvlNode(AvlNode node)
public AvlNode<T> search(T item)
public AvlNode<T> searchNode(AvlNode<T> targetNode)
public void delete(T item)
public void deleteNode(AvlNode<T> node)
public void deleteLeafNode(AvlNode<T> node)
public void deleteNodeWithALeftChild(AvlNode<T> node)
public void deleteNodeWithARightChild(AvlNode<T> node)
public int searchClosestNode(AvlNode node)
node
-
public AvlNode<T> findSuccessor(AvlNode<T> node)
public void insertNodeLeft(AvlNode<T> node)
node
- REQUIRES: a previous call to searchClosestNode(node)public void insertNodeRight(AvlNode<T> node)
node
- REQUIRES: a previous call to searchClosestNode(node)public int compareNodes(AvlNode node1, AvlNode node2)
node1
- node2
-
public void rebalance(AvlNode<T> node)
public void leftRotation(AvlNode<T> node)
public void rightRotation(AvlNode<T> node)
public void doubleLeftRotation(AvlNode<T> node)
public void doubleRightRotation(AvlNode<T> node)
public int getBalance(AvlNode<T> node)
public boolean AvlIsEmpty()
public void insertTop(AvlNode node)
public AvlNode<T> getTop()
public void setTop(AvlNode<T> top)
public int height(AvlNode<T> node)
public java.lang.String toString()
toString
in class java.lang.Object
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES All Classes | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |