Heap Order eSign with airSlate SignNow

Heap create esign

Alright, welcome back to the channel Today. We have a very interesting question. Your interviewer asks you to implement a binary. We'll get into all this but first I want to say if you haven't subscribed to the channel, Subscribe to the channel and like this video, my goal is to make this the world's largest resource for software engineering interview questions that's kind of ambitious and I know I won't do something as large as you know, Leet code or geeks for geeks, but I want this to be as helpful and as central of a resource. As possible, that's why I give every video a table of contents. That's why I try to keep things structured. So that's like a study resource. Today's question is implement a binary heap. So what is a heap and how do we implement it? How do we even go about this question? So we're going to get into all of that. So the key thing that a heap offers us is it offers us either the largest or the smallest number of a group of numbers. So we have a group of numbers here in a tree like. And we notice that we have constant time access or peak. we can pick the smallest elements and it's five. so this is a heap. We're going to get into all that like I said before. But first, I want to say that this is a data structure. A heap is a data structure. A heap is not a abstract data type. the most fundamental things we have in computer science to model the way data is stored and retrieved and and worked with is. Abstract data types things like stats things like a queue. So if a heap is a data structure and it's not an abstract data type. What is it? So let's investigate the abstract data type priority Queue. Okay. So before we investigate what a heap is we need to see where does a heap come from what is a heap and implementation of so a heap is a maximally efficient implementation of the priority queue abstract data type. What is an abstract data type again, so an abstract data type is a set of behaviors that we define a certain data type to have so that we can even call it that data type. So for a stack, we know we need to support push and pop for a queue. We know we need to support enqueue and DeQueue so an abstract data type. roughly speaking is when we support a core API that characterizes that data type, we can then call it that data type or an. Implementation of the abstract data type, but the reason it is abstract is because we can do it. However, we want they keep it abstract and just say we want these behaviors. We don't worry about how you're going to do it so what are priority queues behaviors. So this is...