algo-binary-search-trees

SKILLWorkflowcommunauté
v0.0.0Pavel-KravchenkoUnknownMis à jour il y a 1 moisSource →

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 →
4Étoiles du dépôt
1Clients
1Formats
il y a 1 moisDernière mise à jour
Skill
AuteurPavel-Kravchenko
Version0.0.0
LicenceUnknown
CatégorieWorkflow
Formatsskill.md
PromptNon publié
Compatibilité
Claude✓ Pris en charge
Cursor—
Copilot—
ChatGPT—
Gemini—
À propos

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.

Mots-clés
skillclaude