complete-k-ary-tree
v1.1.3npm· JavaScriptA 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".
The verdict
Abandoned. Last published 8 years ago. No recent activity — look for a maintained alternative.
No recent activity — look for a maintained alternative.
Live from the npm registry · derived rules, not AI
How it scores
MaintenanceAbandoned
PopularityUnknown
SecurityClean
LicensePermissive
DepsModerate
Maintenance
Last published 8 years ago.
Popularity
Download count unavailable.
Security
No known advisories for this version (OSV).
License
ISC
Dependencies
5 direct dependencies
Recent releases
- 1.1.38 years ago
- 1.1.28 years ago
- 1.1.18 years ago
- 1.1.08 years ago
- 1.0.98 years ago
- 1.0.88 years ago
- 1.0.78 years ago
- 1.0.68 years ago