Advanced Data Structures and Algorithms in Java 9 : Priority Queue ADT and Heap | packtpub.com

662 views · Published 11 September 2017 · 8:57 · Indexed 10 November 2026

Channel: Packt · 2017 · Science & Technology

Watch on YouTube

This playlist/video has been uploaded for Marketing purposes and contains only selective videos. 

For the entire video course and code, visit [http://bit.ly/2vOG348].

A priority queue ADT is similar to a queue but the elements have a feature called priority. A heap is a balanced binary tree with some constraints. We will get to know more about them in this video. 
• Create interface for priority queue 
• Insert and remove elements from heap 
• Analyze complexity and implement serialized and array- backed heap 



For the latest Application development video tutorials, please visit
http://bit.ly/1VACBzh


Find us on Facebook -- http://www.facebook.com/Packtvideo
Follow us on Twitter - http://www.twitter.com/packtvideo

More from this channel