k-ary tree (K> = 2) leaf node n0 = n2 + 2n3 + 3n4 + ... + (k-1) nk + 1
k tree node mid formula
Guess you like
Origin blog.csdn.net/qq_44256227/article/details/93460593
Ranking
k-ary tree (K> = 2) leaf node n0 = n2 + 2n3 + 3n4 + ... + (k-1) nk + 1