dsalgo 0.3.10

A package for Datastructures and Algorithms.
Documentation
1
2
3
4
/// all nodes have capacity formed of 2^k - 1
/// if a node have capacity of 7, the sub tree can have at most 7 nodes.
/// childs of the node have capacity of 3,
/// nodes which capacitied with 1 are leaves, and they have no childs.