bst-avl-mcp
Enables interactive learning and visualization of Binary Search Trees and AVL Trees through operations like insertion, deletion, and tree traversal, with real-time balancing rotations.
- Score
- Unranked
- Evidence
- No signals yet
- Last commit
- as last read from GitHub; most reads are from 2 Sep 2026 or later
- Listed
Install
No one-command install. Set it up from its source.
Alternatives · MCPs
- yeuxuan-ace-codebase-indexer360 stars · 40 forks95.766
- yatotm-tavily-loadbalancer69 stars · 13 forks88.701
- ravenwits-arangodb47 stars · 11 forks85.959
What it is
Enables interactive learning and visualization of Binary Search Trees and AVL Trees through operations like insertion, deletion, and tree traversal, with real-time balancing rotations.
When to use it
Enables interactive learning and visualization of Binary Search Trees and AVL Trees through operations like insertion, deletion, and tree traversal, with real-time balancing rotations.
How to install / invoke
See Glama for the install config.
Notes
Listed from the Glama MCP registry.