AvlTree

java.lang.Object
- java.util.AbstractCollection<T>
- - de.topobyte.adt.avltree.AvlTree<T>

All Implemented Interfaces:: BinaryTree<T>, Tree<T>, Iterable<T>, Collection<T>, List<T>, Set<T>, SortedSet<T>

public class AvlTree<T>
extends AbstractCollection<T>
implements Set<T>, SortedSet<T>, List<T>, BinaryTree<T>

Constructor Summary

Constructors

Constructor and Description
`AvlTree()`
`AvlTree(Comparator<? super T> comparator)`

Method Summary

All Methods

Instance Methods

Concrete Methods
Modifier and Type	Method and Description
`void`	`add(int index, T element)`
`boolean`	`add(T element)`
`boolean`	`addAll(int index, Collection<? extends T> c)`
`boolean`	`checkBalanced()` Check whether the tree is balanced.
`void`	`clear()` Removes all elements from the tree.
`Comparator<? super T>`	`comparator()`
`boolean`	`contains(Object object)`
`boolean`	`containsElement(T e)` Test whether this tree stores the specified element.
`List<T>`	`elementsAsList()` Get all elements stored in this tree as a list.
`T`	`findMax()` Find the biggest element stored in this tree.
`T`	`findMin()` Find the smallest element stored in this tree.
`TreeNode<T>`	`findNode(T e)`
`T`	`first()`
`T`	`get(int index)`
`BinaryTreeNode<T>`	`getBinaryRoot()`
`T`	`getElement(int index)` Get the element at position `index`
`int`	`getHeight()` Get the height of the tree.
`TreeNode<T>`	`getRoot()`
`SortedSet<T>`	`headSet(T toElement)`
`int`	`indexOf(Object o)`
`boolean`	`insertElement(T e)` Insert the specified element into the tree.
`boolean`	`isEmpty()` Returns `true` if this tree contains no elements.
`Iterator<T>`	`iterator()`
`T`	`last()`
`int`	`lastIndexOf(Object o)`
`ListIterator<T>`	`listIterator()`
`ListIterator<T>`	`listIterator(int index)`
`T`	`remove(int index)`
`boolean`	`remove(Object object)`
`boolean`	`removeElement(T e)` Remove the specified element from the tree if present.
`T`	`set(int index, T element)`
`int`	`size()` Get the number of elements stored in this tree.
`List<T>`	`subList(int fromIndex, int toIndex)`
`SortedSet<T>`	`subSet(T fromElement, T toElement)`
`SortedSet<T>`	`tailSet(T fromElement)`
`String`	`toFoldedString()` Create a printable representation of the tree.

Methods inherited from class java.util.AbstractCollection
addAll, containsAll, removeAll, retainAll, toArray, toArray, toString

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.SortedSet
spliterator

Methods inherited from interface java.util.Set
addAll, containsAll, equals, hashCode, removeAll, retainAll, toArray, toArray

Methods inherited from interface java.util.Collection
parallelStream, removeIf, stream

Methods inherited from interface java.lang.Iterable
forEach

Methods inherited from interface java.util.List
addAll, containsAll, equals, hashCode, removeAll, replaceAll, retainAll, sort, spliterator, toArray, toArray

- Constructor Detail
  - AvlTree
```
public AvlTree()
```
  - AvlTree
```
public AvlTree(Comparator<? super T> comparator)
```
- Method Detail
  - insertElement
```
public boolean insertElement(T e)
```
    Insert the specified element into the tree.
  - removeElement
```
public boolean removeElement(T e)
```
    Remove the specified element from the tree if present.
    
    Returns:
    
    true if the element was found and removed.
  - clear
```
public void clear()
```
    Removes all elements from the tree.
  - isEmpty
```
public boolean isEmpty()
```
    Returns true if this tree contains no elements.
    
    Specified by:
    
    isEmpty in interface Collection<T>
    
    Specified by:
    
    isEmpty in interface List<T>
    
    Specified by:
    
    isEmpty in interface Set<T>
    
    Overrides:
    
    isEmpty in class AbstractCollection<T>
    
    Returns:
    
    true if this tree contains no elements.
  - getHeight
```
public int getHeight()
```
    Get the height of the tree.
    
    Specified by:
    
    getHeight in interface Tree<T>
    
    Returns:
    
    the height of the tree.
  - size
```
public int size()
```
    Get the number of elements stored in this tree.
    
    Specified by:
    
    size in interface Collection<T>
    
    Specified by:
    
    size in interface List<T>
    
    Specified by:
    
    size in interface Set<T>
    
    Specified by:
    
    size in class AbstractCollection<T>
    
    Returns:
    
    the number of elements.
  - containsElement
```
public boolean containsElement(T e)
```
    Test whether this tree stores the specified element.
    
    Returns:
    
    true if the specified element is already present in the tree.
  - getElement
```
public T getElement(int index)
```
    Get the element at position index
  - findMin
```
public T findMin()
```
    Find the smallest element stored in this tree.
    
    Returns:
    
    the smallest element in this tree or null if this tree does not contain any elements.
  - findMax
```
public T findMax()
```
    Find the biggest element stored in this tree.
    
    Returns:
    
    the biggest element in this tree or null if this tree does not contain any elements.
  - elementsAsList
```
public List<T> elementsAsList()
```
    Get all elements stored in this tree as a list.
    
    Returns:
    
    a list containing all elements stored in this tree.
  - findNode
```
public TreeNode<T> findNode(T e)
```
  - toFoldedString
```
public String toFoldedString()
```
    Create a printable representation of the tree.
  - checkBalanced
```
public boolean checkBalanced()
```
    Check whether the tree is balanced.
  - add
```
public boolean add(T element)
```
  - contains
```
public boolean contains(Object object)
```
  - remove
```
public boolean remove(Object object)
```
  - iterator
```
public Iterator<T> iterator()
```
  - comparator
```
public Comparator<? super T> comparator()
```
  - first
```
public T first()
```
  - last
```
public T last()
```
  - headSet
```
public SortedSet<T> headSet(T toElement)
```
  - tailSet
```
public SortedSet<T> tailSet(T fromElement)
```
  - subSet
```
public SortedSet<T> subSet(T fromElement,
                           T toElement)
```
  - add
```
public void add(int index,
                T element)
```
  - addAll
```
public boolean addAll(int index,
                      Collection<? extends T> c)
```
  - set
```
public T set(int index,
             T element)
```
  - get
```
public T get(int index)
```
  - remove
```
public T remove(int index)
```
  - indexOf
```
public int indexOf(Object o)
```
  - lastIndexOf
```
public int lastIndexOf(Object o)
```
  - listIterator
```
public ListIterator<T> listIterator()
```
  - listIterator
```
public ListIterator<T> listIterator(int index)
```
  - subList
```
public List<T> subList(int fromIndex,
                       int toIndex)
```
  - getRoot
```
public TreeNode<T> getRoot()
```
  - getBinaryRoot
```
public BinaryTreeNode<T> getBinaryRoot()
```

Class AvlTree<T>

Constructor Summary

Constructors

Method Summary

Methods inherited from class java.util.AbstractCollection

Methods inherited from class java.lang.Object

Methods inherited from interface java.util.SortedSet

Methods inherited from interface java.util.Set

Methods inherited from interface java.util.Collection

Methods inherited from interface java.lang.Iterable

Methods inherited from interface java.util.List

Constructor Detail

AvlTree

AvlTree

Method Detail

insertElement

removeElement

clear

isEmpty

getHeight

size

containsElement

getElement

findMin

findMax

elementsAsList

findNode

toFoldedString

checkBalanced

add

contains

remove

iterator

comparator

first

last

headSet

tailSet

subSet

add

addAll

set

get

remove

indexOf

lastIndexOf

listIterator

listIterator

subList

getRoot

getBinaryRoot