add Real-World Example to Heaps

Author: MarcoBasileDev

Cheatsheet/Heaps/heaps.md

@@ -21,3 +21,9 @@ A heap is a data structure that organizes elements based on priority, ensuring t
 ## Priority queue
 
 A priority queue is a special type of heap that follows the structure of min-heaps or max-heaps but allows customization in how elements are prioritized (e.g. prioritizing strings with a higher number of vowels.)
+
+---
+
+### Real-World Example
+
+**Managing tasks in operating systems:** Operating systems often use a priority queue to manage the execution of tasks, and a heap is commonly used to implement this priority queue efficiently. For example, when multiple processes are running on a computer, each process might be assigned a priority level. The operating system needs to schedule the processes so that higher-priority tasks are executed before lower-priority ones. A heap is ideal for this because it allows the system to quickly access the highest-priority task and efficiently re-arrange the priorities as new tasks are added or existing tasks are completed.