# Advanced Data Structures & Algorithms in Java: Working with the Binary Heap

Java    |    Intermediate
• 16 videos | 1h 57m 21s
• Includes Assessment
Rating 4.6 of 15 users (15)
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

• After completing this video, you will be able to explain the common operations to be performed on a priority queue.
• 3.  The Binary Heap
Upon completion of this video, you will be able to describe how a binary heap data structure works.
• 4.  Binary Heap: Implementation
After completing this video, you will be able to explain the array implementation of a binary heap.
• 5.  Binary Heap: Heapify
In this video, you will learn how to summarize the heapify operation on a binary heap.
• 6.  Binary Heap: Insert and Remove
After completing this video, you will be able to recognize how to insert and remove works on a binary heap.
• 7.  The Heap Base Class
In this video, you will write code for the base class operations in a binary heap.
• 8.  The Maximum Heap
In this video, you will learn how to implement a maximum heap.
• 9.  Operations on a Maximum Heap
Find out how to perform operations on a heap with a maximum size.
• 10.  The Minimum Heap and Operations on a Minimum Heap
In this video, you will learn how to implement a minimum heap.
• 11.  Heap Sort
After completing this video, you will be able to recognize the functioning of the heap sort algorithm.
• 12.  Heap Sort: Heapify
Upon completion of this video, you will be able to describe how heapify works in the heap sort.
• 13.  Heap Sort: Sort
After completing this video, you will be able to explain how the heap sort is used for sorting.
• 14.  Implementing Heapify
In this video, learn how to write code for the heapify operation in a heap sort.
• 15.  Implementing Sort
In this video, you will learn how to implement the sort functionality in a heap sort.
• 16.  Course Summary

## 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.

## YOU MIGHT ALSO LIKE

Rating 4.5 of 100 users (100)
Rating 4.6 of 26 users (26)
Rating 5.0 of 1 users (1)

## PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.6 of 26 users (26)
Rating 4.6 of 50 users (50)
Rating 4.9 of 8 users (8)