Python Data Structures Implementation

Help me implement the following data structure in Python: [CHOOSE ONE]
- Linked List (Singly/Doubly)
- Binary Search Tree
- Hash Table
- Heap (Min/Max)
- Graph (Directed/Undirected)
- Trie
- LRU Cache
- Stack/Queue with special features

Requirements:
1. Full implementation with type hints
2. All standard operations (insert, delete, search, etc.)
3. Iterator protocol support (__iter__, __next__)
4. String representation (__str__, __repr__)
5. Comparison operations if applicable
6. Time complexity analysis for each method
7. Space complexity analysis
8. Comprehensive unit tests
9. Usage examples
10. Edge case handling