complete-k-ary-tree
ISCA 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".
64
Security score
0 known advisories in v1.1.3
OpenSSF Scorecard 1.5/10
Weekly downloads
0
Unpacked size
—
Dependencies
5
Last publish
8 years ago
Security advisories
No known vulnerabilities affect v1.1.3.
Downloads — last 30 days
33 total▼ 100.0% vs prior week
Jul 3Aug 1
OpenSSF ScorecardJul 20, 2026
- Maintained0
- Code-Review0
- Binary-Artifacts10
- CII-Best-Practices0
- Security-Policy0
- License0
- Fuzzing0
- Branch-Protection0
- SAST0