algo-binary-search-trees

SKILLWorkflowcommunity
v0.0.0Pavel-KravchenkoUnknownUpdated 3mo agoSource →

Implement/debug a binary search tree in Python: insert, search, delete (3 cases), successor/predecessor, inorder/level-order traversal. Use for BST coding, O(log n) vs O(n) degenerate cases, or choosing AVL/Red-Black.

Community-submitted skill. Not yet reviewed by the Forge team. Full prompt content may not be available.Request review →
4Repo stars
1Clients
1Formats
3mo agoLast update
Skill
AuthorPavel-Kravchenko
Version0.0.0
LicenseUnknown
CategoryWorkflow
Formatsskill.md
PromptNot published
Compatibility
Claude✓ Supported
Cursor—
Copilot—
ChatGPT—
Gemini—
About

Implement/debug a binary search tree in Python: insert, search, delete (3 cases), successor/predecessor, inorder/level-order traversal. Use for BST coding, O(log n) vs O(n) degenerate cases, or choosing AVL/Red-Black.

Keywords
skillclaude

No dependency coverage

This entry publishes no npm package, so Forge has no dependency tree for it. That is a gap in coverage — not a statement that it has no dependencies.

Topics

Related in search & retrieval