Unnamed: 0 int64 1 5.86k | Question stringclasses 24
values | Sample ANS stringclasses 24
values | Student ANS stringlengths 1 1.06k | Score float64 0 2.5 |
|---|---|---|---|---|
3,929 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is data structure , like priority queue .\nwe have here max and min heap to solve our problem like max and min operation in an efficient way | 2.5 |
3,930 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Two types of heap Min-heap and Max-heap.\nIn min heap the data is sorted in ascending order in the form of a tree in which the minimum element is the root .\nIn max heap the data is sorted in descending order in the form of a tree in which the maximum element is the root . | 2.5 |
3,931 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | It is a complete binary tree where every node has either 0 or 2 children. There are two types of heaps - minHeap where the minimum element is placed at the root and maxHeap where the maximum element is placed at the root. | 2.5 |
3,932 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap data structure is a complete binary tree which has either 0 or 2 children and further heap is divided into two sub categories minheap and maxheap. Minheap has minimum element in the root node and maxheap has maximum element in the root node. The traversal goes down by comparing both the children and the one min is... | 2.5 |
3,933 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | if is the data structure used to store information in sorted order. If the Heap is Max heap then it will store data in such a manner that data of the child node is always less then the parent node. If it is min heap then it will store in such a manner that data of parent is always less then child. | 1 |
3,934 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a data structure that stores data in the form of a tree either in ascending order(min-heap) or descending order(max-heap). | 2 |
3,935 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is used when we have to store the elements which are already sorted. There are two types of heaps that is min heap and max heap. max heap is a heap in which the child node is always less than the parent node, whereas in min heap it makes sure that the parent node is less than the child node. | 1 |
3,936 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is basically of two types:\n1) min heap: value of parent node is lesser then the its children\n2) max heap: value of parent node is greater then the its children | 2 |
3,937 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is a data structure which is basically a complete binary tree in which each node will be greater than its child nodes or smaller than its child nodes. | 2 |
3,938 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is the data structure with time complexity of n log(n).\nInstead of sorting nodes one by one before placing in the tree. Heap helps us to sort them in the tree only there are 2 types of heap max heap and min heap.\nit select the minimum value in the heap and traverse it upwards by swapping from upper node one by o... | 2 |
3,940 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a data structure based on tree. A heap is a complete binary tree. | 1 |
3,941 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is a data structure that is made up of complete binary tree. It helps in extracting max or min element. | 2 |
3,942 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a kind of data structure which help in arranging the data in a ascending or descending order . Heaps are of 2 types MIN-HEAP and MAX-HEAPS. | 2 |
3,943 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | An AVL tree is the one which is a balanced binary tree i.e. every node has its (max left child length- max right child length)=1,0,-1. | 0 |
3,944 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a complete binary tree in which we cant move to the next level without filling the current level. It can be made using priority queue. | 2.5 |
3,945 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a data structure, which all the elements of a tree are stored in an array or linked list. If the parent node is at nth index in the array, then the first child is at 2n+1, second child at 2n+2 and so on. It is a representation of a tree in form of an array or linked list. | 1 |
3,946 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap refers to the data structures where the root and intermediate nodes have right and left children which are 2n+1 and 2n+2 respectively for parent node located at n index. Heap can be implemented using arrays, linked list and trees. In case of max and min heap , parent node is greater or smaller than child nodes res... | 2 |
3,947 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a data structure that is based on the advanced version of queues that is priority queues. | 1 |
3,948 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A graph with n vertices can have n-1 spanning trees. As there can be multiple ways to join all vertices but not create a cycle. | 0 |
3,949 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is another type of array of a data structure. | 1 |
3,950 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap in data structure uses trees for implementation, there are two types of heaps a max heap where all the child nodes are smaller than the parent element and min heap where all the child nodes are greater than the parent node. | 2 |
3,951 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is Data Structure is a dynamic data structure that is used to store data either in ascending order(Min Heap) or Descending Order as Max Heap. | 2.5 |
3,952 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a type of data structure to store the data ascendingly or in descending order i.e. 'min Heap' or 'max Heap'. | 1 |
3,953 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a kind of data structure to store the data ascending or in descending order. | 1 |
3,954 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is used to store the data in increasing or non-increasing order. | 1 |
3,955 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a data structure that stores data which have operations like heap sort and heapify. These are of two types: Min heap and Mex heap. Min heaps are formed by keeping the root node minimum and as data at the leaf as maximum whereas in case of max heap we have root as maximum and leaf as minimum. | 2.5 |
3,956 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A data structure (array) which can be represented as the complete binary tree and having it parent node smaller than its children node(min heap) is called a heap. | 2.5 |
3,957 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a specialized tree-based data structure that is used to maintain a collection of elements where the highest (or lowest) priority element can be accessed quickly. It has two main variants: max-heap and min-heap. In a max-heap, the parent node is always greater than or equal to its children nodes, while in a mi... | 2.5 |
3,958 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is an data structure in which the tree is a complete binary tree and is a special binary tree. | 2 |
3,959 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a dynamic data structure that contains the address of values rather that storing them itself which makes it fast and efficient | 1 |
3,960 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | It is the memory in which data is stored temporarily when operations are being carried out. | 1 |
3,961 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | a heap is an optimized form of priority queue which is used to store the numbers in such a manner that it is easier to find the number and do the required operations | 2 |
3,962 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap data structure is basically a binary tree. It can be of two types - min heap and max heap\nHeap in data structure is a binary tree. | 2.5 |
3,963 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a data structure in which the parent node is lesser or greater than the children node\nMin heap has parent lesser than the children node\nMax heap has parent greater than the children node\nHeap is used for heap sort. Heap also has a lot of function like extract min, decrease key etc. | 2.5 |
3,964 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is type of tree which is arranged in increasing or decreasing order in which leaf value is less than right value. | 1 |
3,965 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | it is a binary tree in which root is compared with children it is of 2 types - max heap & min heap | 2 |
3,966 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a tree based data structure in which the tree is completely binary tree | 2 |
3,967 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly.\n\n | 2 |
3,968 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | a heap is a type of data structure that stores the data similar to a tree and is usually when we need to remove the root node priority (highest or lowest) wise. It is also used to insert values which will be stored either in min heap ( lower value priority) or max heap (higher value priority) | 2 |
3,969 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is used to store in such a manner that either the minimum data stays on top and then bigger than it becomes its child and then again the child of it follows that its child are bigger than it or the maximum data stays on top and then its child are smaller than it and again there child are smaller then them. | 2.5 |
3,970 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is a data structure like stack and queue that stores values. Binary heap can store value accordingly and is a preferable method in many cases for searching and sorting \n | 2 |
3,971 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a priority queue where we can decide the order of insertion and deletion based on our requirements. | 2 |
3,972 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a specialized tree-based data structure which is essentially an almost complete binary tree that satisfies the heap property. Their are two types of max heap and min heap . | 2 |
3,973 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | it a tree in which the tree is complete binary tree.it implements priority queue.in this tree the highest or the lowest element is thee root node. | 1 |
3,974 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a data structure where the data is stored in the form of a sorted tree where the parent node can have multiple child nodes. A heap can either be a min heap or a max heap depending on the way it is sorted. | 2 |
3,975 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heaps are tree like structures where the child element is always greater or smaller than the parent element. Examples are min heap, max heap, etc.. | 2.5 |
3,976 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | it is tree based data structure in which it is a complete binary tree. if the most effecient implementation of the data type priority queue | 1 |
3,977 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | \nThere are three types of heaps\n1.Binomial heap\n2.Fibonacci heap\n3. Min heap/ max heap | 1 |
3,978 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | a heap is a data structure used to arrange data in a sorted manner, we take the first data inputted as head of the heap and then keep on inserting data below it, data is then shifted and pushed down accordingly considering whether it is min heap or max heap. | 2 |
3,980 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is nothing but a special tree whose root node has a lesser left child and greater right child. | 2 |
3,981 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a data structure which uses a tree to arrange the values given in an ascending or descending order. | 2.5 |
3,982 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | a heap data structure is implemented by following the heap property when connecting the two nodes of the heap\nHeap property is when the root element is greater or smaller than as mentioned than the children nodes of the heap | 2 |
3,983 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. | 2 |
3,984 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | it is a kind of tree | 0 |
3,985 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is the data structure of arrangement which gives the max or min element from the set of element | 1 |
3,986 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a form of a tree, there are two types of heap, min heap and max heap\nIn a min heap, the parent node is smaller than that of its child nodes\nIn a max heap, the parent node is greater than that of its child notes | 2.5 |
3,987 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | a heap is a tree only with few constraints | 2.5 |
3,988 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is a special case of balanced binary tress data structure where the root node key is compared with its children and arranged accordingly. | 2 |
3,989 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is data structure which has the maximum or minimum element at the root node | 2 |
3,990 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a kind of tree which has the root node as either max element or min element .It can be of 2 types min heap(root=min) or max heap(root=max) | 2.5 |
3,991 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | a heap stores data according to a constraint in a tree in the form of binary heap,binomial heap,max heap,min heap fibonacci heap depending upon the operations neede to be performed. | 2 |
3,992 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is the balanced binary tree, which includes min heap and max heap. | 1 |
3,993 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a special tree based data structure in which the tree is complete binary tree. | 0 |
3,994 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a tree based data structure in which all nodes of a tree are in specific order. | 1 |
3,995 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | a heap is a data structure used to store and sort data by assigning them to left and right child of the root node and so on. | 2.5 |
3,996 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a linear data structure which is implemented by queue | 2 |
3,997 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a data structure that store a data in encoded form , if we want retrieve out we have to decode it by the type of heap we used to encode it. | 1 |
3,998 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | a complete binary tree is heap | 1 |
3,999 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | it is a efficient data structure that helps it has max heap and min heap it has max/min element at top\nit helps to find kth smallest or largest element | 2 |
4,000 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a data structure which can be implemented using priority queues. A heap tree is a tree in which on deletion, the highest element (in case of maxHeap) or the lowest element (in case of minHeap) gets deleted first.\n | 2.5 |
4,001 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap in data structure is arrangement of data by insertion of max elements first or by min elements an order of max elements first is maintained\nmax elements arranged are called max heap whereas elements arranged accord | 2.5 |
4,002 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A graph has (|E|-1-no. of cycles) number of spanning trees spanning trees. | 1 |
4,003 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | n^(n-2) where n has no. of nodes | 1 |
4,004 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap data structure is a tree data structure and is in the form of min/max heap. In min heap the parent node is greater than both of its children and the element to be added is added to the last node. | 2.5 |
4,005 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap gives us the largest or the smallest value that we want in any case\nlike max heap, min heap.\ndone using priority_queue\nin case of max heap we get maximum element at the top\nand in case of min heap we get the minimum element at the top. | 1 |
4,006 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A Heap data Structure is type of Data Structure in which we used to store data in pilled up manner \nex. priority queue | 1 |
4,008 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap in a special tree based data structure in which the tree is a complete binary tree where all nodes of a tree are in a specific order. | 2 |
4,009 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | data structure in which maximum and minimum values stores at the top of the tree it vcan be of 2 types max an min heap. max heap have maximu value on to. while min heap have mim value on top. | 1 |
4,010 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a tree-based data structure in which all the nodes of the tree are in a specific order. | 1 |
4,011 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap refer to a large memory block. Heap is based upon LIFO- Last in first out principle. | 2 |
4,012 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a data structure to store elements in form of a tree. There are two types of heaps\n1) Min heap- the root node will contain the minimum value element\n2) Max heap - root node will hold the maximum value element. | 1 |
4,013 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is binary tree. it has two types- max and min heap. in max heap, the maximum element becomes the root node and in min heap, minimum element becomes the root node. | 1 |
4,014 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a binary tree that arranges data in order( ascending - min heap, descending - max heap) | 2 |
4,015 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap data structure is basically a data structure in which the data is stored in the form of :\nMin Heap: every child node is greater than the parent node. (root node is minimum)\nMax Heap: every child is lesser than the parent node. (root is maximum).\nPriority Queue: The elements are retrieved according to the specif... | 1 |
4,016 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | in this data structure the value of the parent node must be greater than or equal to (in case of max heap ) or less than or equal to (in case of minheap) to its child nodes.\n | 2 |
4,017 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is like a tree which stores data in an ordered manner. Min heap accounting for ascending as the head node is the smallest value among them all and Max heap accounting for descending as it places the largest value as the head node. | 1 |
4,018 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | at maximum the graph can have (no of edges+1) spanning tress. | 2 |
4,019 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap data structure stores values such that greater(maxheap) or lower(minheap) value is parent of lesser or greater values. Used to extract minimum of the values list. | 2 |
4,020 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is type of data structure where the first element is either smallest or largest depending upon the heap and the parents of each element lie on 2N and 2N+1. | 1 |
4,022 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | maximum number of spanning trees : n^(n-2) | 1 |
4,023 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a tree data structure where the elements are structured in a way such that the highest value element is on the top (max-heap) | or the minimum value element is on the top (min-heap). Heaps are used to implement priority queues. | 2 |
4,024 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a complete binary tree, and the binary tree is a tree in which the node can have utmost two children. | 2 |
4,025 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is like a tree data structure but it does not store elements in random order. It has two types - Min Heap and Max Heap. Mean heap stores the elements in increasing order and Max Heap stores in decreasing order. | 2 |
4,026 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | there are two types of heap that are min heap and max heap. Min heap is a tree in which the node will have the minimum element. | 1 |
4,027 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | It is similar to tree\ndata stored in ordered manner\nmin heap -> smallest e;lement in head node | 2 |
4,028 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | A heap is a data structure which contains either the maximum(max heap) or minimum (min heap) value on the top of the tree. | 1 |
4,029 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | tree traversal is a way of traversing the binary trees in which we cover all the elements, It is of 3 types -> preorder, inorder, postorder | 2 |
4,030 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heap is a special case of balanced binary data structure where the root node key is compared with its children and arranged accordingly. | 1 |
4,031 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | Heaps are the non linear data structures which stores the data hierarchially in form of trees. There are nodes and each node | 1 |
4,032 | What is a heap in data structure? | Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs. | heap is a tree data structure in which value stored at each node is smaller than its children in case of min-heap or value stored at each node is greater than its children in case of max-heap. | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.