A tree data structure in which every internal node (non-leaf node) has either one data element and two children or two data elements and three children.
Main Operations
- Delete: if there exist in the data structure a key that matches the key the method received, then the method deletes the key and his associated information.
- Search: if there exist in the data structure a key that matches the key the method received, then the method returns a copy of the key and his associated information. Otherwise the method returns null.
- Rank: if there exist in the data structure a key that matches the key the method received, then the method returns the place of the key in the linear order (asc) of the keys of the data structure. Otherwise the method returns 0.
- Select: if there exist a key in the place of the index that the method received, the method returns a copy of the key in this place. Otherwise the method returns null.
- SumValuesInInterval: The method returns the sum of the value associated with the keys in the range that the method received. If there are no keys in the range the method returns null.