no less, no more) 5^i nodes on the other hand, in the second case, this rule isn't valid since the Tree can be filled randomly by construction.Ĭomplete n-ary Trees can be serialized into an array simply extending from the complete Binary Search Tree: nodes (intermediary and leaves) are related each other by the level i and the actual N by the forum Ni+1+c* where c is the c-th child. In the first case, assuming that N=5 so each level i in the Tree will have exactly (i.e. It is needed to distinguish between two cases: 1.
