algo-binary-search-trees

SKILLFlujo de trabajocomunidad
v0.0.0Pavel-KravchenkoUnknownActualizado hace 1 mFuente →

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 →
4Estrellas del repo
1Clientes
1Formatos
hace 1 mÚltima actualización
Skill
AutorPavel-Kravchenko
Versión0.0.0
LicenciaUnknown
CategoríaFlujo de trabajo
Formatosskill.md
PromptNo publicado
Compatibilidad
Claude✓ Compatible
Cursor—
Copilot—
ChatGPT—
Gemini—
Acerca de

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.

Palabras clave
skillclaude