Search results

n-ary-tree

n-ary tree implementation in JavaScript(TypeScript).

• n-ary
• k-ary
• m-ary
• data-structures
• tree
• preorder
• postorder
• levelorder

lbwa

• 0.4.0 • 5 years ago • 4 dependents • MITpublished version 0.4.0, 5 years ago4 dependents licensed under $MIT

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".

• k-ary
• tree

bjk543

• 1.1.3 • 8 years ago • 0 dependents • ISCpublished version 1.1.3, 8 years ago0 dependents licensed under $ISC