Allocate each item of one list to random branches, it can make it by three different algorithm for distribution items. The number of branches is determined by N.
-Arbitrary Distribution: with different branch size.
-Homogeneous Distribution: with same branch size as far as possible.
-Equal Distribution: with the exact same branch size, it culls overload items randomly.
|Data||D||Data items to get distributed||Goo|
|Number||N||The number of branches||Integer|
|Seed||S||Optional seed number||Integer|
|Data Tree||D||The tree of data||Goo|