Advanced Data Structures & Algorithms in Java: Working with the Binary Heap
Java SE 13
| Intermediate
- 16 Videos | 2h 4m 21s
- Includes Assessment
- Earns a Badge
The binary heap, the data structure used to implement a priority queue, is an interesting data structure. Recognizing how best to work with the binary heap is part of creating sturdy and fast software programs. In this course, you'll explore the binary heap data structure used to implement a priority queue in a performant and efficient manner. You'll recognize how the binary heap is essentially a binary tree that satisfies two additional constraints: the heap property and the shape property. You'll examine how the binary heap can be represented using an array and how it allows us to implement add, remove, and access operations on a priority queue in an extremely high-performing manner. Finally, you'll learn how the binary heap helps us implement an efficient sort algorithm: the heap sort.
WHAT YOU WILL LEARN
-
discover the key concepts covered in this course
explain the common operations to be performed on a priority queue
describe how a binary heap data structure functions
explain the array implementation of a binary heap
summarize the heapify operation on a binary heap
recognize how insert and remove works on a binary heap
write code for the base class operations in a binary heap
implement the maximum heap -
perform operations on a maximum heap
implement the minimum heap
recognize the functioning of the heap sort algorithm
describe how the heapify in the heap sort works
explain how the heap sort is used for sorting
write code for the heapify operation in heap sort
implement the sort functionality in heap sort
summarize the key concepts covered in this course
IN THIS COURSE
-
1.Course Overview1m 58sUP NEXT
-
2.The Priority Queue7m 29s
-
3.The Binary Heap7m 11s
-
4.Binary Heap: Implementation8m 32s
-
5.Binary Heap: Heapify6m 17s
-
6.Binary Heap: Insert and Remove8m 28s
-
7.The Heap Base Class11m 17s
-
8.The Maximum Heap6m 56s
-
9.Operations on a Maximum Heap5m 58s
-
10.The Minimum Heap and Operations on a Minimum Heap9m 40s
-
11.Heap Sort4m 18s
-
12.Heap Sort: Heapify9m 9s
-
13.Heap Sort: Sort12m 1s
-
14.Implementing Heapify10m 34s
-
15.Implementing Sort6m 16s
-
16.Course Summary1m 16s
EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE
Skillsoft is providing you the opportunity to earn a digital badge upon successful completion of this course, which can be shared on any social network or business platform
Digital badges are yours to keep, forever.
