joowani/binarytree
Python Library for Studying Binary Trees observed · 2026-08-28
Health v2 · maintenance only
23/100
- Activity 0
- Release rhythm 8
- Longevity 100
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 3634
- days_rel: n/a
- days_push: 1064
- n_releases_24m: 0
Adoption not part of the score
1813 stars · 174 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
A Python library for generating, visualizing, inspecting, and manipulating binary trees, including binary search trees and heaps. It is designed to help students and interview candidates practice tree algorithms without the tedium of building test data by hand.
Use cases
- generate random binary trees for algorithm practice
- visualize binary trees in the terminal or Jupyter notebooks
- create test data for binary search tree problems
- practice coding interview tree questions
- generate heaps for studying heap algorithms
- inspect and manipulate tree node structures in Python
When to avoid
- you need production-grade, self-balancing trees like red-black or AVL trees
- you need a high-performance tree data structure for a real application
- you need trees other than binary trees (e.g., n-ary or B-trees)
Facets
library · maturity maintenance
data-visualization developer-tools education developer-tools python cross-platform binary-tree binary-search-tree heap data-structures interview-practice tree-visualization jupyter algorithms
2 sources
- readme: https://github.com/joowani/binarytree · fetched 2026-08-28 · 43daf4e37b88
- registry_pypi: https://pypi.org/pypi/binarytree/json · fetched 2026-08-29 · e0b0adc21094
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| joowani/binarytree | main | 23 |
For agents
markdown · JSON · MCP: product_card(name="joowani/binarytree")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem