Book Image

Advanced Data Structures and Algorithms in Java 9 [Video]

By : Debasish Ray Chawdhuri
Book Image

Advanced Data Structures and Algorithms in Java 9 [Video]

By: Debasish Ray Chawdhuri

Overview of this book

<p>Advanced Data Structures and Algorithms in Java 9 covers classical, functional, and reactive data structures, giving you the ability to understand computational complexity, solve problems, and write efficient code. This video is based on the Zero Bug Bounce milestone of Java 9. We start off with the basics of algorithms and data structures, helping you understand the fundamentals and measure complexity. You will also get a clear picture of reactive programming, binary searches, sorting, search trees, undirected graphs, and a whole lot more!</p> <h2>Style and Approach</h2> <p>This course is a step-by-step guide; each concept is explained before every exercise</p>
Table of Contents (6 chapters)
Chapter 4
Advanced General Purpose Data Structures
Content Locked
Section 1
Priority Queue ADT and Heap
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