UsefulLinks
Computer Science
Algorithms and Data Structures
Immutability and Immutable Data Structures
1. Fundamentals of Immutability
2. Persistent Data Structures
3. Core Operations and Algorithms
4. Immutable List Structures
5. Immutable Tree Structures
6. Immutable Hash-Based Structures
7. Immutable Set Operations
8. Queue and Stack Structures
9. Concurrency and Thread Safety
10. State Management Patterns
11. Performance Characteristics
12. Language Support and Implementation
13. Library Ecosystems
14. Design Patterns and Practices
15. Migration and Integration Strategies
16. Advanced Concepts and Research
17. Practical Applications and Case Studies
8.
Queue and Stack Structures
8.1.
Immutable Stacks
8.1.1.
Push Operations
8.1.2.
Pop Operations
8.1.3.
Peek Operations
8.1.4.
Stack Composition
8.2.
Immutable Queues
8.2.1.
Single-Ended Queues
8.2.1.1.
Enqueue Implementation
8.2.1.2.
Dequeue Implementation
8.2.1.3.
Banker's Queue
8.2.1.4.
Real-Time Queue
8.2.2.
Double-Ended Queues
8.2.2.1.
Front Operations
8.2.2.2.
Rear Operations
8.2.2.3.
Deque Variants
8.3.
Priority Queues
8.3.1.
Heap-Based Priority Queues
8.3.2.
Tree-Based Priority Queues
8.3.3.
Skew Heaps
8.3.4.
Leftist Heaps
Previous
7. Immutable Set Operations
Go to top
Next
9. Concurrency and Thread Safety