4. PRIORITY QUEUE | Introduction with example | Data Structure Full Course

Published: 20 August 2022
on channel: PSN Academy

A Priority Queue is a linear structure in which each item is associated with a priority and an item with higher priority takes place in front of the item with lower priority.

During insertion: Insert new item from any end, since the position depends upon the priority.
During deletion: Remove item from front only.

Rule 1: The element with the highest priority pointed by FRONT should be processed (and deleted if required) first.
Rule 2: In case of equal priority, the element with earlier timestamp should be processed first.

Implementation:
a. Linked list
b. Array

My socials:
psnacademy.in@gmail.com
https://psnacademy.in
  / psnayak
  / psnayakeducator
https://www.buymeacoffee.com/psnayak
  / psnayak2007

Note: This video is copyrighted, no part of it to be reproduced or republished.

Thumbnail background image: http://www.freepik.com | Designed by pch.vector / Freepik

On this page of the site you can watch the video online 4. PRIORITY QUEUE | Introduction with example | Data Structure Full Course with a duration of hours minute second in good quality, which was uploaded by the user PSN Academy 20 August 2022, share the link with friends and acquaintances, this video has already been watched 88 times on youtube and it was liked by 1 viewers. Enjoy your viewing!

4,309

161