Advanced Data Structures & Algorithms in Java: Working with the Binary Heap
Java SE 13
| Intermediate
- 16 videos | 1h 57m 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
-
1m 58s
-
7m 29sAfter completing this video, you will be able to explain the common operations to be performed on a priority queue. FREE ACCESS
-
3. The Binary Heap7m 11sUpon completion of this video, you will be able to describe how a binary heap data structure works. FREE ACCESS
-
4. Binary Heap: Implementation8m 32sAfter completing this video, you will be able to explain the array implementation of a binary heap. FREE ACCESS
-
5. Binary Heap: Heapify6m 17sIn this video, you will learn how to summarize the heapify operation on a binary heap. FREE ACCESS
-
6. Binary Heap: Insert and Remove8m 28sAfter completing this video, you will be able to recognize how to insert and remove works on a binary heap. FREE ACCESS
-
7. The Heap Base Class11m 17sIn this video, you will write code for the base class operations in a binary heap. FREE ACCESS
-
8. The Maximum Heap6m 56sIn this video, you will learn how to implement a maximum heap. FREE ACCESS
-
9. Operations on a Maximum Heap5m 58sFind out how to perform operations on a heap with a maximum size. FREE ACCESS
-
10. The Minimum Heap and Operations on a Minimum Heap9m 40sIn this video, you will learn how to implement a minimum heap. FREE ACCESS
-
11. Heap Sort4m 18sAfter completing this video, you will be able to recognize the functioning of the heap sort algorithm. FREE ACCESS
-
12. Heap Sort: Heapify9m 9sUpon completion of this video, you will be able to describe how heapify works in the heap sort. FREE ACCESS
-
13. Heap Sort: Sort12m 1sAfter completing this video, you will be able to explain how the heap sort is used for sorting. FREE ACCESS
-
14. Implementing Heapify10m 34sIn this video, learn how to write code for the heapify operation in a heap sort. FREE ACCESS
-
15. Implementing Sort6m 16sIn this video, you will learn how to implement the sort functionality in a heap sort. FREE ACCESS
-
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 on some of our courses, which can be shared on any social network or business platform.
Digital badges are yours to keep, forever.
