# Data Structure Analysis Examples

## Example 1: Binary Search Tree Analysis

**Input:**
```
Analyze Binary Search Tree data structure including operations and use cases.
```

**Expected Output:**
Complete BST analysis with O(log n) average operations, O(n) worst case, comparison with AVL trees and Red-Black trees, use cases for ordered data.

## Example 2: Hash Table Deep Dive

**Input:**
```
Explain hash table implementation, collision resolution strategies, and performance characteristics.
```

**Expected Output:**
Hash table structure, O(1) average operations, collision resolution (chaining, open addressing), load factor impact, comparison with tree-based maps.

## Example 3: Structure Selection

**Input:**
```
Which data structure should I use for implementing an LRU cache?
```

**Expected Output:**
Recommendation for hash map + doubly linked list combination, O(1) operations analysis, implementation strategy, comparison with alternatives.

## Usage Tips

- Specify the data structure name for detailed analysis
- Ask about specific operations if needed
- Mention performance requirements
- Include language/platform if relevant
- Request comparisons for decision-making

## Common Use Cases

- Data structure selection for projects
- Performance optimization
- Interview preparation
- Educational learning
- Architecture design decisions
- Code review and refactoring