69 CS651 Lecture Notes - Array Data Structure, Binary Tree, Heapsort
Document Summary
L46: heap data structures - max heap and min. Heap | lesson 46 | dsa in java | @codingninjasindia. This video is a part of the new playlist of videos on data structures and algorithms in java by coding ninjas. in this video we will learn about the following things. We will see why we should learn heap data structures. we will begin with fundamentals of eep and how we can build a heap data structure using insertion deletion operations moving ahead. We will also see the key elements that are often asked in the interviews like heapsort, maxi and minheep. Then we "ll see how we. can implement heap data. structure using priority queues in java. I will also solve three coding question on code studio platform that i "ve seen a lot of times in my interview and in the end i.