4. Complexity of operations #
Created Tuesday 04 August 2020
- Least child of special child is ceil(S/m), m children for the current node.
- Maximum children of any node is S/m. Tree size is halving. logn is the maximum time for change.
- find does it in (logn)^2^