C++ Priority Queue - Percolate Down

Published: 14 October 2022
on channel: C++ Data Structures

937

A demonstration of the percolateDown() method of the priority queue. This method ensures that a heap is well formed - an important operation in the priority queue data structure.

You can learn more about the priority queue and other data structures in C++ Data Structures by James Helfrich: https://he.kendallhunt.com/product/c-...

0:00 Introduction
0:29 Percolate Down algorithm
1:05 percolateDown() on a node without children
1:48 percolateDown() on a node with two children
2:29 percolateDown() when multiple levels need to be called
3:21 percolateDown() called on the root

On this page of the site you can watch the video online C++ Priority Queue - Percolate Down with a duration of hours minute second in good quality, which was uploaded by the user C++ Data Structures 14 October 2022, share the link with friends and acquaintances, this video has already been watched 937 times on youtube and it was liked by 14 viewers. Enjoy your viewing!

1,440