complete-k-ary-tree
A complete k-ary tree is a k-ary tree which is maximally space efficient. It must be completely filled on every level except for the last level. However, if the last level is not complete, then all nodes of the tree must be "as far left as possible".
n-ary-tree
n-ary tree implementation in JavaScript(TypeScript).
