Agent skill
data-structures
Master selection and implementation of data structures. Learn when to use arrays, lists, trees, graphs, heaps, and hash tables for optimal performance.
Install this agent skill to your Project
npx add-skill https://github.com/pluginagentmarketplace/custom-plugin-computer-science/tree/main/skills/data-structures
SKILL.md
Data Structures Skill
Skill Metadata
skill_config:
version: "1.0.0"
category: implementation
prerequisites: [cs-foundations]
estimated_time: "6-8 weeks"
difficulty: intermediate
parameter_validation:
structure_type:
type: string
enum: [array, list, tree, heap, hash, graph, trie]
required: true
operation:
type: string
enum: [search, insert, delete, traverse]
retry_config:
max_attempts: 3
backoff_strategy: exponential
initial_delay_ms: 500
observability:
log_level: INFO
metrics: [structure_usage, operation_complexity]
Quick Start
Choose the right structure for every problem. Master operations and trade-offs.
Linear Structures
Arrays
- Random access O(1)
- Fixed size
- Cache friendly
- Use: Known size, frequent access
Linked Lists
- Dynamic size
- Sequential access O(n)
- Efficient insertion/deletion O(1)
- Types: Singly, doubly, circular
Stacks
- LIFO principle
- Push/pop O(1)
- Use: Undo/redo, parenthesis matching, DFS
Queues
- FIFO principle
- Enqueue/dequeue O(1)
- Types: Simple, circular, priority, deque
- Use: BFS, job scheduling
Trees
Binary Search Trees
- Ordered storage
- Search/insert/delete O(log n) avg
- Traversals: inorder, preorder, postorder
Balanced Trees
- AVL: height-balanced
- Red-Black: color-based balancing
- B-Trees: multi-way
- Guarantee O(log n) operations
Heaps
- Min/Max heap property
- Insert/delete O(log n), Build O(n)
- Use: Priority queues, heap sort
Hash Structures
Hash Tables
- Average O(1) operations
- Collision handling: chaining, open addressing
- Load factor matters
Decision Matrix
| Need | Best Structure |
|---|---|
| Random access | Array |
| Frequent insertions/deletions | Linked list |
| Min/max element | Heap |
| Ordered traversal | BST |
| Fast lookup | Hash table |
| Prefix matching | Trie |
| Relations | Graph |
Complexity Comparison
| Operation | Array | List | BST | Hash | Heap |
|---|---|---|---|---|---|
| Search | O(n) | O(n) | O(log n) | O(1) avg | O(n) |
| Insert | O(n) | O(1)* | O(log n) | O(1) avg | O(log n) |
| Delete | O(n) | O(1)* | O(log n) | O(1) avg | O(log n) |
Troubleshooting
| Issue | Root Cause | Resolution |
|---|---|---|
| Hash collision storm | Poor hash function | Improve hash, use chaining |
| Tree degenerates | Sorted insertions | Use balanced tree (AVL/RB) |
| Memory exhaustion | No size limits | Add capacity limits |
| Iterator invalidation | Modify during iteration | Use safe iteration pattern |
Implementation Checklist
- Dynamic array with resizing
- Singly/doubly linked list
- Stack and queue
- Binary search tree
- AVL tree or Red-Black tree
- Hash table
- Min/max heap
- Trie
- Graph (adjacency list)
- Disjoint set union
Recommended Agent Skills
Expand your agent's capabilities with these related and highly-rated skills.
cs-foundations
Master discrete mathematics, logic, formal proofs, and computational thinking. Build the mathematical foundation for all computer science.
advanced-topics
Explore advanced CS topics including advanced data structures, parallel computing, security, functional programming, and quantum computing.
complexity-analysis
Analyze algorithm complexity, understand Big O notation, computability theory, NP-completeness, and computational limits.
algorithms
Master algorithm design, common patterns, optimization techniques, and problem-solving strategies. Learn to solve any computational challenge efficiently.
systems-computing
Understand computer systems from digital logic through operating systems, networks, databases, and distributed systems.
deep-learning
Neural networks, CNNs, RNNs, Transformers with TensorFlow and PyTorch. Use for image classification, NLP, sequence modeling, or complex pattern recognition.
Didn't find tool you were looking for?