Obtains all values in the tree in a a order that is sorted by keys, either forwards or backwards.
The values can be put in any container or class that implements the IObjectAddable interface.
Because by nature AVL trees are sorted then this function requires zero effort to sort.