Description: Tree AVL
In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than one, rebalancing is done to restore this property. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where n is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.
To Search:
File list (Check if you may need any files):
TREE_INT\.classpath
........\.project
........\.settings\org.eclipse.jdt.core.prefs
........\bin\br\uefs\ecmop\util\ArvoreAVL.class
........\...\..\....\.....\....\Folha.class
........\...\..\....\.....\....\Mains.class
........\...\..\....\..omp\model\Container.class
........\src\br\uefs\ecmop\util\ArvoreAVL.java
........\...\..\....\.....\....\Folha.java
........\...\..\....\.....\....\Mains.java
........\...\..\....\..omp\model\Container.java
........\bin\br\uefs\ecmop\util
........\...\..\....\..omp\model
........\src\br\uefs\ecmop\util
........\...\..\....\..omp\model
........\bin\br\uefs\ecmop
........\...\..\....\ecomp
........\src\br\uefs\ecmop
........\...\..\....\ecomp
........\bin\br\uefs
........\src\br\uefs
........\bin\br
........\src\br
........\.settings
........\bin
........\src
TREE_INT
Download