Skills
.Work. You
Rest

binary-search-trees

Community

Reason about BSTs with balance and invariants.

Software Engineering#invariants#data-structures#transplant#bst#rotations#binary-search-tree
AuthorArcadi4
Version1.0.0
Installs0

System Documentation

What problem does it solve?

This skill teaches a structured mindset for reasoning about binary search trees, red-black trees, and related ordered containers, helping engineers separate invariant logic from implementation details to inform production choices.

Core Features & Use Cases

  • Understand the BST invariant and how duplicates are handled across different policies.
  • Evaluate when to prefer balanced trees, arrays, or library containers for production workloads.
  • Apply rotation, transplant, and deletion concepts to reason about object identity and performance in real systems.

Quick Start

Analyze how your current ordered container handles insertion, search, and deletion while tracking height, balance, and iterator validity.

Dependency Matrix

Required Modules

None required

Components

Standard package

💻 Claude Code Installation

Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.

Please help me install this Skill:
Name: binary-search-trees
Download link: https://github.com/Arcadi4/nerdy/archive/main.zip#binary-search-trees

Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
View Source Repository

Agent Skills Search Helper

Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.