algo-binary-search-trees

SKILLFlusso di lavorocommunity
v0.0.0Pavel-KravchenkoUnknownAggiornato 1 mesi faFonte →

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 →
4Stelle del repo
1Client
1Formati
1 mesi faUltimo aggiornamento
Skill
AutorePavel-Kravchenko
Versione0.0.0
LicenzaUnknown
CategoriaFlusso di lavoro
Formatiskill.md
PromptNon pubblicato
Compatibilità
Claude✓ Supportato
Cursor—
Copilot—
ChatGPT—
Gemini—
Descrizione

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.

Parole chiave
skillclaude