Krio tree

In graph theory, a k-Aryan tree is a rooted tree in which each node has only children k. It is also sometimes known as a k-tree way, an N-Aryan tree, or an M-Aryan tree.

A binary tree is the special case where k = 2

A complete k-Aryan tree is a k-Aryan tree where each node on the same level 0 has children k.

For a k-tree with height h, the upper limit for the maximum number of leaves is h k. The total number of nodes is k h + 1 & # x2212; 1 k & # x2212; 1 {\displaystyle {\frac {k^{h+1}-1}{k-1}}} , while height h is & # x2308; log k & # x2061; ( k & # x2212; 1 ) + log k & # x2061; ( n u m b e r & # x005F; O f & # x005F; n O d e s ) & # x2212; 1 & # x2309; {\displaystyle \left\lceil \log _{k}(k-1)+\log _{k}({\mathit {number\_of\_nodes}})-1\right\rceil } .

wiki