🔥 priority queue adt → A priority_queue extends a queue by replacing FIFO removal with priority-based selection while retaining enqueue/dequeue/peek-style operations (often implemented with a heap).

🔥 heap based priority queue → A heap-based priority queue extends the queue ADT by providing enqueue/peek/dequeue-like operations but removes elements by priority—implemented via a heap—rather than FIFO, building on queue semantics and interfaces.

⚡️ circular array →

⚡️ breadth first search →

⚡️ level order traversal →

⚡️ topological sort →

⚡️ round robin scheduling →

⚡️ binary tree →

⚡️ graph traversal →