SortedBinTree Class Reference

Detailed Description

This class provides a collection implementation as a sorted binary tree. Whatever the performed action (lookup, insertion or deletion), it has an average complexity of O(log(n)) with a worst case of O(n). The worst case is reached if the items are inserting in order. Notice that no method of this class is implemented recursively.

This class implements the concept of concept::MutableCollection.

Parameters

T	Type of items in the data structure.
C	Type describing the comparison operation (must implement elm::concept::Comparator<T>, elm::Comparator<T> as a default).

---

The documentation for this class was generated from the following file:

• src/genstruct_SortedBinTree.cpp