Harsh-7300/dataset huggingface dataset:
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: 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.
Score: 2.5

Student answer: Heap is type of tree which is arranged in increasing or decreasing order in which leaf value is less than right value.
Score: 1.0

Student answer: it is a binary tree in which root is compared with children it is of 2 types - max heap & min heap
Score: 2.0

Student answer: Heap is a tree based data structure in which the tree is completely binary tree
Score: 2.0

Student answer: 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
Score: 2.0

Student answer: 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)
Score: 2.0

Student answer: 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.
Score: 2.5

Student answer: 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
Score: 2.0

Student answer: Heap is a priority queue where we can decide the order of insertion and deletion based on our requirements.
Score: 2.0

Student answer: 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 .
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: 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..
Score: 2.5

Student answer: 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
Score: 1.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: \nThere are three types of heaps\n1.Binomial heap\n2.Fibonacci heap\n3. Min heap/ max heap
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: Heap is nothing but a special tree whose root node has a lesser left child and greater right child.
Score: 2.0

Student answer: A heap is a data structure which uses a tree to arrange the values given in an ascending or descending order.
Score: 2.5

Student answer: 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
Score: 2.0

Student answer: Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly.
Score: 2.0

Student answer: it is a kind of tree
Score: 0.0

Student answer: heap is the data structure of arrangement which gives the max or min element  from the set of element 
Score: 1.0

Student answer: 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
Score: 2.5

Student answer: a heap is a tree only with few constraints 
Score: 2.5

Student answer: heap is a special case of balanced binary tress data structure where the root node key is compared with its children and arranged accordingly.
Score: 2.0

Student answer: heap is data structure which has the maximum or minimum element at the root node
Score: 2.0

Student answer: 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)
Score: 2.5

Student answer: 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.
Score: 2.0

Student answer: Heap is the balanced binary tree, which includes min heap and max heap.
Score: 1.0

Student answer: A heap is a special tree based data structure in which the tree is complete binary tree.
Score: 0.0

Student answer: Heap is a tree based data structure in which all nodes of a tree are in specific order.
Score: 1.0

Student answer: 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. 
Score: 2.5

Student answer: A heap is a linear data structure which is implemented by queue
Score: 2.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: 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.
Score: 1.0

Student answer: a complete binary tree is heap
Score: 1.0

Student answer: 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 
Score: 2.0

Student answer: 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
Score: 2.5

Student answer: 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
Score: 2.5

Student answer: A graph has (|E|-1-no. of cycles) number of spanning trees spanning trees.
Score: 1.0

Student answer: n^(n-2) where n has no. of nodes
Score: 1.0

Student answer: 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.
Score: 2.5

Student answer: 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.
Score: 1.0

Student answer: A Heap data Structure is type of Data Structure in which we used to store data in pilled up manner \nex. priority queue 
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: A heap is a tree-based data structure in which all the nodes of the tree are in a specific order. 
Score: 1.0

Student answer: Heap refer to a large memory block. Heap is based upon LIFO- Last in first out principle. 
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: 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.
Score: 1.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: A heap is a binary tree that arranges data in order( ascending - min heap, descending - max  heap)
Score: 2.0

Student answer: 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 specified priority. (minimum or maximum, lesser then or greater than).
Score: 1.0

Student answer: 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
Score: 2.0

Student answer: 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. 
Score: 1.0

Student answer: at maximum the graph can have (no of edges+1) spanning tress.
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: maximum number of spanning trees : n^(n-2)
Score: 1.0

Student answer: 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.
Score: 2.0

Student answer: A heap is a complete binary tree, and the binary tree is a tree in which the node can have utmost two children. 
Score: 2.0

Student answer: 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.
Score: 2.0

Student answer: 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.
Score: 1.0

Student answer: It is similar to tree\ndata stored in ordered manner\nmin heap -> smallest e;lement in head node
Score: 2.0

Student answer: A heap is a data structure which contains either the maximum(max heap) or minimum (min heap) value on the top of the tree.
Score: 1.0

Student answer: 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
Score: 2.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: Heap is a special case of balanced binary data structure where the root node key is compared with its children and arranged accordingly.
Score: 1.0

Student answer: Heaps are the non linear data structures which stores the data hierarchially in form of trees. There are nodes and each node  
Score: 1.0

Student answer: 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.
Score: 1.0

Student answer: heap data structure create two heap  max heap or min heap .In min heap top element will be minimum and last element will be maximum and  max heap will be opposite of it .
Score: 2.0

Student answer: Heap is a data structure in which the elements are placed in such a manner that all the elements before the root are smaller than the root and all the elements after the root are larger than the root. It is a flexible d.s, with applications :-\n1)Fibonacci heap\n2)Binary heap\n3)Heap sort
Score: 1.0

Student answer: 2 * Number of Edges
Score: 2.0

Student answer: heap data structure is a process by which you can optimise the solution to less time complexity by using heap , in this we make heap of small sizes and then we perform the work , lie min heap concept is used in kruskal's algorithm for reducing the time of kruskal;s algo from N^2 to (nlogn)
Score: 2.0

Student answer: a heap is a DATA structure which is a sorted tree and the min\\max element can be prioritised as the top node, \nthere are several types, binomial heap, min heap max heap etc
Score: 2.0

Student answer: heap is a special balanced  binary  tree where root node 
Score: 2.0

Student answer: heap is a type of data structure that helps us into the efficiency of the program and can use global variable in it
Score: 1.0

Student answer: A heap is a binary tree which follows a certain heap property. Like a max-heap will follow max-heap property which means the in a max heap the topmost element of the heap will be always the largest element in the heap, whereas in  a min heap the topmost element of the heap will be always the smallest element in the heap.
Score: 1.0

Student answer: heap is of two type min and max which allow us to make min heap or ma heap
Score: 2.0

Student answer: Heap is a data structure that is used to store information in tree like formation in minimum or maximum manner which is performed by heapify function\nTwo types of heap\na)Min heap\nb)Max heap
Score: 1.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: A heap is a data structure in which topmost element is minimum and its children are bigger than the node and so on. Or topmost element is maximum and its children are smaller than the node. It is used when less time is required because it can perform operations like insert, delete or search an element with less time complexity. 
Score: 1.0

Student answer: there are three types of heap binomial heap fibonacci heap and binary heap
Score: 2.0

Student answer: a graph can have spanning trees equal to the number of nodes of the graph.
Score: 2.0

Student answer: a heap is a data structure which stores minimum element as root and then subsequent child nodes
Score: 2.0

Student answer: heap in a data stucture is tree
Score: 2.0

Student answer: A heap is a data structure which is of two kinds a min heap or a max heap. In a min heap the parent element is always supposed to be smaller than its child nodes. 
Score: 2.0

Student answer: Heap is a useful data structure when its necessary to repeatedly remove the object with the highest (or lowest) priority or when insertions needs to be interspersed with removals of root node.
Score: 2.0

Student answer: There are two types of heap one is min heap and the other is max heap, in min heap the sum of the child nodes is greater than the value at parent node and in max heap  the sum of the child nodes is less than the value at parent node .
Score: 1.0

Student answer: heap is a data structure in which we change the indexes of the elements of the array according the type of heap i.e min or max heap.\n
Score: 1.0

Student answer: heap is a data structure wherein the parent is either always larger or always smaller than its child nodes.
Score: 1.0

Student answer: There are two types of heaps . First min heap where the root node is less than the child nodes and the second max heap where the root node is greater than the child nodes.
Score: 1.0

Student answer: Heap arranges data in form of tree but the elements in this tree is based on the type of heap. if it is min heap the root  or parent is always smaller then its children. And if max heap then root or parent is always greater than its children.
Score: 1.0

Student answer: heap is a data structure which is a binary tree in which either we have the root the largest element and then the next smallest on level 1, or the smallest element on the root and then the just larger one on the level 1 and so on depending upon our requirements.
Score: 1.0

Student answer: heap is a kind of tree whish is in sorted form called min heap or max heap. heap carries out operations like sorting, searching, insertion, deletion.
Score: 1.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: Heap data structure is a type of data structure which stores the minimum or maximum element at the top. This data structure is generally used implemented using arary while the indexig is assigned in such a way that it behaves like a binary tree.
Score: 1.0

Student answer: a heap is a data structure that stores the data in tree format either in increasing order where root element is smallest i.e minheap or it stores it in descending order (maxheap)where root is the greatest element.
Score: 1.0

Student answer: it is used to store data, we can create min and max heap which is arranges in the ascending/descending order
Score: 1.0

Student answer: Non linear data structure. 
Score: 1.0

Student answer: edges-1
Score: 1.0

Student answer: Heap in a data structure is a non-linear data structure, in which n number of nodes can be linked to its parent node.
Score: 1.0

Student answer: heap is a container like structure used to store array values or integers
Score: 1.0

Student answer: A heap is a data structure in which elements are stored in form of a tree. it has two types - min heap and max heap. either the min or max element is maintained on the top and elements as we go down the tree follow the same property. While inserting, deleting, we need to maintain them.  These are useful to store and access min and max elements when need be.
Score: 1.0

Student answer: A heap is a balanced binary tree whose root node is its key node and is compared with its children nodes.
Score: 1.0

Student answer: heap is a balanced binary tree where root node key is compared to its children
Score: 1.0

Student answer: It is the balanced binary tree data structure where the root node key is compared with its children and arranged accordingly.
Score: 1.0

Student answer: Heap is a balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly.
Score: 1.0

Student answer: Heap is a data structure where we can traverse the complete binary tree as well as it is an  area in  computer  for main storage of memory.
Score: 1.0

Student answer: heap is to maintain a large amount of data , heap can also is called a tree \nit stores the data 
Score: 1.0

Student answer: It is a type of data structure which 
Score: 1.0

Student answer: A Heap is a special tree data structure in which the tree is a complete binary tree.
Score: 1.0

Student answer: A heap is a type of data structure in which a tree is the binary tree and it is use to store global variables.
Score: 1.0

Student answer: Heap is a tree based data structure which is a complete binary tree that satisfies the heap property.\nHere  a root node is compared with its children and then it is placed accordingly depending on whether it is a min Heap or a max Heap. 
Score: 1.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: a non linear data structure in which the root node is always maximum or minimum value and is maintained throughout the data strucutre 
Score: 1.0

Student answer: Heap data structure is a tree based data structure either a maximum elements are at top and lowest at bottom or vice a versa.
Score: 1.0

Student answer: Heap is a tree which always have its minimum or maximum element at its root or a tree in which a parent node is always bigger/smaller(max heap/ min heap) than a given child node. It is a complete binary tree
Score: 1.0

Student answer: Heap data structure is a type of binary tree which follows either of the 2 rules. Either a child can not be greater than the parent . Heap formed in such a way is called Max Heap. or the parent cannot be greater than a child , such a heap is called Min Heap.
Score: 1.0

Student answer: heap is defined as special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly
Score: 1.0

Student answer: Heap is a tree based data structure where either the minimum elements are at the top and max at the bottom or vice versa
Score: 1.0

Student answer: Heap is a data structure which is a Binary tree and it also follows the complete binary tree property. There are teo kind of heaps:\n1. Min heap - It stores the minimum element at its root and follows CBT property.\n2. Max heap - It stores maximum element at its root and follows CBT property.
Score: 1.0

Student answer: heap is a kind of data structure which stores the data. There are various types of heap one of them is binary heap.
Score: 1.0

Student answer: heap is a data structure to store data in minheap form and maxheap form. eg in minheap every children is greater than its parent.
Score: 1.0

Student answer: A Heap is a special Tree-based data structure in which the tree is a complete binary tree.\nThere are two kinds of heaps, minimum heap and maximum heap. 
Score: 1.0

Student answer: heap is a data structure in which the value at a node is smaller than the values at its children and the smallest element is kept at the top of the tree and the tree can be represent using an array where the child of ith node are 2*i and 2*i+1
Score: 1.0

Student answer: Heap data structure is basically a tree having the root node is max or min element of the entire tree depending upon the heapify function\nIt is the special tree because every sub tree node is the max or min value of that tree that help us to find the kth largest or kth minimum element of that tree
Score: 1.0

Student answer: heap is a special tree based data structure in which the tree in completely binary tree and it is of mainly 2 types \n1) min heap - min element is at the top \n2) max heap - largest element is at the top
Score: 1.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: AVL tree is a self balancing tree where in we implement the data structure i.e. the tree in such a way that whenever an element is inserted into an AVL tree, it balances itself before any other operation can be completed on it.  
Score: 1.0

Student answer: Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. If x has child node Î² then âˆ’ key(x) â‰¥ key(y) As the value of parent is greater than that of child it is called Max Heap. Suppose parent is lesser than that of child it is called Min Heap.
Score: 1.0

Student answer: A type of storing data structure that stores the data in two patterns - min Heap and max Heap. It is in our power to store data in the form of parent nodes, and children nodes. It is basically a tree that has been modified in a way that we make any parent node to have children that are only smaller/larger than the parent node. This storage is called a heap, also priority_queue.
Score: 1.0

Student answer: A heap is a data structure in which Array of elements represented as a complete binary tree. It is of two types Min-heap and Max-heap.\nIn min-heap the root node of the heap is the smallest element and all the parent elements are smaller than their children.\nIn Max-heap the root element is the largest element in the heap and the the parent nodes are greater from their children.
Score: 1.0

Student answer: Heap is a other name of priority queue in which element are store in form of a binary tree (implemented with use of array)with child nodes and parent with elements having their priority priority order for eg. min heap ,max heap.
Score: 1.0

Student answer: Heap in a data structure is used to represent elements\nIt is of two types:\nMin heap:In this type,the parent element is smaller than the child.\nMax heap:In this type,the parent element is bigger than the child.
Score: 1.0

Student answer: It is a data structure in which the elements are stored in the form of binary tree.\nIt is of two type MIN Heap and MAX Heap.\nIn MIN Heap minimum element is present at the root .\nIn MAX Heap maximum element is present at the root .
Score: 1.0

Student answer: A heap is a data structure that resembles a tree but infact, is multiple trees combined in a minimum/maximum fashion.\nA Minimum Heap (or a MinHeap) is a heap which has the minimum number/value at its root node, and arranges the rest of the values in increasing order towards the leaf nodes.\nA Maximum Heap (or a MaxHeap) is a heap which has the maximum number/value at its root node and arranges the rest of the values in decreasing order towards the leaf nodes.
Score: 1.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: heap data structure is build by using priority queue and is of two types-:\n1-min heap-in this heap minimum elements is placed at to top or root node it is build using priority queue.\n2-maxheap-in this heap max element is place at the top.
Score: 1.0

Student answer: elements are arranged in the form of binary tree having two ways to do it, namely min heap and max heap. In max heap highest value element is placed on the root node and in min heap lowest value element is placed at the root node
Score: 1.0

Student answer: AVL tree is a type of binary search tree. Rotations are performed on it, to sort the elements. The rotations involve-\n1. LL - left left\n2. RR- right right\n3. LR- left right\n4. RL- right left
Score: 1.0

Student answer: heap is a data structure in which we use array to store data . it is a complete binary tree and it is of two type max heap and min heap.
Score: 1.0

Student answer: Heap is data structure that stores element in the form of an array but we visualize it as a complete binary tree. There are two types of heap in general i.e. min heap and max heap.
Score: 1.0

Student answer: heap is a type of data structure in which we can construct various types of heaps like min-heap,max-heap,etc. The min heap provides a data sorted in decreasing fashion and max heap provides a solution in ascending order.
Score: 2.0

Student answer: heap is a data structure used to store information on top of the given information. in max heap, the maximum element will be the parent node and in min heap, minimum element will be parent node.
Score: 2.0

Student answer: In head the data is stored in position which is determined by a formula there are two types of head-\nmin head\nmax head
Score: 1.0

Student answer: heap is dynamic structure it has two variant min heap and max heap it can be transferred in an array.
Score: 1.0

Student answer: heap is a binary tree where the value stored at parent node is always greater than the value at child node
Score: 2.5

Student answer: Heap is similar to tree but it contains information in two formats - \n1. Max Heapify - In this case root node should hold the maximum value and every parent node should be greater than its children node.\n2. Min Heapify - In this case root node should hold the minimum value and every children node should be greater than their parent's node.
Score: 2.5

Student answer: heap is a tree like data structure in which node are arranged in either decreasing order or in increasing order based on which heaps are named as minheap and maxheap respectively. if we do the level order traversal of a minheap or maxheap we get values arranged in ascending or descending order respectively
Score: 2.0

Student answer: Heap is a dynamic data structure it has 2 variants minheap and maxheap it can be traversed in form of array.
Score: 1.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: Heap is a Data structure which stores memory value of the variable it can be used for pointers There are two types of Heap Data Structure first one is MIn Heap and the other one is Max Heap.In Min Heap our Root value of the tree must be of minimum value and in Max Heap root value of the Tree must be maximum 
Score: 2.0

Student answer: A heap tree holds data such that values to greater than parent node goes to the right node and values smaller goes to the left of the parent node.
Score: 0.0

Student answer: A heap data structure is used to store data in such a way that left of root shoulld always be smaller and right of root should always be greater. In Heap Root should always be the smallest element.
Score: 0.0

Student answer: heap is a data structure in which max/min element is on top and then accordingly a tree is then formed
Score: 1.0

Student answer: it is different type of data structure made up by using trees and can be considered and extension to trees. it is of many types such as binary heap , binomial heap etc. 
Score: 0.0

Student answer: Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. Heap in data structure can be of two types min heap and max heap.
Score: 1.0

Student answer: Heap data structures can be visualized as a binary tree where the top most node value can be maximum or minimum among all decided by the type of heap. Heap can be of two types Min-Heap and Max-Heap.  In Min-Heap min element is at the top and vice-versa in Max-Heap.
Score: 2.0

Student answer: Heap in data structure always stores the least or greatest element at its top, so its used when we need to extract minimum or maximum element.
Score: 2.5

Student answer: heap is a non linear data structure
Score: 1.0

Student answer: a heap is data structure is which remove the object when it is on higher or lower priority 
Score: 1.0

Student answer: heap data structure consists of parent node and child nodes forming a heap like structure 
Score: 1.0

Student answer: Heap in data structure means that the value of parent node is bigger than its left and right child.  We can create two types of heap :- Max heap and Min heap . This data structure is more useful in deletion , insertion etc.
Score: 2.5

Student answer: heap is a type of data structure in which elements are arranged in such a way that it follows min-heap or max-heap property according to the requirement of the problem.
Score: 2.0

Student answer: Heap is non linear data structure . which is working in both form array or linked list. 
Score: 1.0

Student answer: in heap every element is stored in a form of reference each element has a reference to it to get identified 
Score: 0.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: Heap is a form of data structure where data is arranged in smaller heaps and grouped to form the bigger heaps. There are two types of heaps, Min-Heaps and Max-Heaps, Min-Heap being in the form such that root is the smallest of the whole heap and same rule is followed throughout the heap while Max-Heap is just opposite.
Score: 1.0

Student answer: heaps are non linear data structure used to store the data
Score: 1.0

Student answer: there are the two type of heap :\n--> MinHeap(minimum element  on a root node)\n--> MaxHeap(maximum element on root node)
Score: 1.0

Student answer: heap is a data structure which stores the data of given information or array
Score: 0.0

Student answer: heap or priority queue is a data structure can be used under hoffman encoding algorithm
Score: 1.0

Student answer: Heap is a non-linear data structure used for storing data. There are two types of heaps: i) MinHeap & ii) MaxHeap\nWe can perform 3 operations on heap: a) Heapify (build heap)    b) Insert  c) Delete                
Score: 2.0

Student answer: a heap is a data structure in which we have data in for of a heap, we use min heap and max heap using heap data structure. 
Score: 1.0

Student answer: one element added in accordance to its parent and left child and right child then operations are performed respectively if one has to perform minimum heap serch then smallest node is present at the top and if max heap perform large element present at top 
Score: 1.0

Student answer: heap is type of dynamic data structure 
Score: 0.5

Student answer: A heap data structure is a modification of the tree data structure in which the children of each node are either larger than their parent node or smaller than their parent node.
Score: 2.5

Student answer: heap is a type of data structure use to  minimize the size of tree. For example Heap Sort.   
Score: 0.0

Student answer: heap is tree like structure used to store data  in tree manner having nodes.
Score: 0.0

Student answer: there are two types of heaps: min heap and max heap.\nit is a binomial tree which follows heap properties.\nwe create a priority queue and heapify it.
Score: 1.0

Student answer: heap is a method to store data in data structure it is optimizer and has less time complexity 
Score: 0.0

Student answer: Its a special type of binomial tree, which follows heap order properties.\nA heap can be - min heap or a max heap 
Score: 0.5

Student answer: heap is min element or max element provide top or bottoms it depend on which type of heap is 
Score: 2.5

Student answer: basically, heap is a binary search tree.
Score: 0.0

Student answer: heap is type of data structure which is dynamically created and properties of a binary search tree \nit is of two types \n1)min heap\n2)max heap 
Score: 0.0
Question: What is a heap in data structure?
Reference answer: 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.

Student answer: heap is basically a data structure where we stores the value or data  in a given problem.
Score: 0.0
Question: What is a recursive function?
Reference answer: A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.

Student answer: A recursive function is one which calls upon itself till the base condition is satisfied.
Score: 2.0

Student answer: recursive function is the function which calls itself again and again multiple number of times for example in fibonacci we call a recursive function fib(n,n-1);
Score: 2.5

Student answer: a recursive function can be defined as a routine that calls itself directly or indirectly when needed in a program 
Score: 2.0

Student answer: Recursive function instead of using loops to move forward to next subproblem, calls itself again with same or different arguments
Score: 2.5

Student answer: Recursive function is a function that calls itself until a certain base condition is met. When the base condition is met it returns a value which goes back to the previous function call. 
Score: 2.5

Student answer: Recursive Functions are used to reduce time complexity and easy to use when we have to call same function again and again for its subproblems.\nRecursive functions are used to memorize value for its subproblems. 
Score: 2.5

Student answer: it is a  concept or property of one or more variables which is specified by a procedure that yields value or instant of that function by repeatedly applying given relation .
Score: 2.5

Student answer: A recursive function is an function which can call itself .
Score: 2.0

Student answer: Recursive function is the those function which calls themselves repeatedly to solve the problem\nthey have a base condition to stop the recursion\n\nalgo recursion(int n)\n{\n     base condition\n      if(n>-1){\n          sum=sum+n;\n         recursion(n-1);\n       }\n       return sum;\n}\n
Score: 2.0

Student answer: a recursive function can be defined as a routine that calls itself directly or indirectly.
Score: 0.0

Student answer: Recursive function is basically a function which works on divide and conqueror. In this divide the problem until we could find the solution of the same smaller problem and hence we try to find the solution for the big problem.\nEx- to find factorial of a number 
Score: 2.5

Student answer: A recursive function is a function that calls  the function itself  to get the solution of the problem and returns the value .
Score: 1.0

Student answer: Recursive function is a function in which it compares the given loop or function again and again till it get the perfect outcome.
Score: 1.0

Student answer: A recursive function is the one that calls itself again and again to solve the given problem.
Score: 1.5

Student answer: the function which depending upon a certain condition calls itself is called recursive function.
Score: 2.5

Student answer: It is function which call itself until the exit condition satisfy.
Score: 2.5
Question: What is a recursive function?
Reference answer: A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.

Student answer: any function that calls itself repeatedly only till the point a certain condition is true is called a recursive function
Score: 2.5

Student answer: recursive function is the function which calls the function again until a required value is obtained .it is combination of three steps determining the base cases forming the recursive relation and returning the solution .it is backbone of dynamic programming
Score: 1.0

Student answer: A recursive function is a function which repeatedly used a set of lines to get a certain output.
Score: 1.0

Student answer:  nodes .
Score: 0.0

Student answer: A recursive function in any coding language is a function that can call itself again and again , it could be directly or indirectly until the program satisfies a specific condition.
Score: 1.0

Student answer: Function which call itself within their own function is called as recursive functions. It find the minimum value of that function which can be used to solve the whole function .\nIt could be a decreasing function or a dividing function which can used to find out the minimum value that function can hold.It can be done by making state space trees  or using masters theorems. 
Score: 2.5

Student answer: Heap is a data structure which is similar to a complete tree.  It is usually used to store data in a particular order. It is useful when a set of variables are not fixed and is changing with each step in an algorithm. There are two types of heaps:\ni) minheap (root node has the minimum element)\nii) maxheap (root node has the maximum element)\nExtracting elements from these heaps gives elements in sorted manner (ascending or descending depending on type of heap). 
Score: 2.5

Student answer: recursive function is a function with call itself many time, it needs extra stack size while  running recursion.\ncontinues call , 
Score: 2.5

Student answer: A function which is called again and again each time on smaller part of the array or list or tree nad each time it waits for the answer from the smaller function is recursive function.
Score: 2.5

Student answer: A function which calls itself in a loop is called a recursive function.
Score: 2.5

Student answer: When a function calls itself within a loop to find a solution, it is called a recursive function.
Score: 2.5

Student answer: recursive function is a function which is called inside itself with smaller parameter. it is a function which find the solution to a given problem by dividing it into several sorter problem. If always contain base case which is always used to find solution.
Score: 2.5

Student answer: A recursive function is a function that calls itself and terminates when a base condition is met.
Score: 2.5
Question: What is a recursive function?
Reference answer: A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.

Student answer: A recursive function is a function that can be called number of times that is again and again within the same program, instead of writing the function again and again we call that function many times as per our requirements. Such functions have a specific function which is required to perform on several number of elements which can be taken as input in the array such as each element of the array can be checked whether it is prime or odd or even etc.
Score: 2.5

Student answer: recursive function means calling the same function multiple times until we don't gate the desired output.\n
Score: 2.5

Student answer: recursive function is a function which calls itself more than once . calling can be outside function or inside function (direct or indirect).\nthe main components of recursive functions are :-\n1-base case where the function gets terminated.\n2-recurrence relation \nand then some optional operations .
Score: 1.0

Student answer: Recursive function is a function to be called again and again infinite number of times to execute until u get the desire output. so instead of calling function again and again implementation of recursive function can be of help examples-to find odd number ,to find prime numbers etc.
Score: 2.0

Student answer: A recursive function is one in which we just make a formula for one case and rest other cases are automatically implemented by that one formula by making a function. \n
Score: 1.0

Student answer: A recursive function is a call to a user built function inside the function itself. This is used to make a loop of the given steps inside the function until a desired output is returned.
Score: 2.0

Student answer: A recursive function is a function which has has base terminating condition else it keeps calling itself again and again till the terminating condition is satisfied.
Score: 2.5

Student answer: Its a kind of function which calls itself in the function. It helps us to solve the huge problems through shorter methods. A recursive function is a kind of function which helps the us to code the program in shorter length. 
Score: 2.5

Student answer: A graph can have a maximum number of spanning trees equal to its vertices.
Score: 2.5

Student answer: A recursive function is as function which includes a call to itself. It comes out of the loop using the base conditions provided.
Score: 2.5

Student answer: A function calling itself is known as recursion.\nIf there is a call to a function, within the function itself, then it is known as recursion. It can either pass different values or same values as well (but passing same values will be of of no benefit and it will stuck in an infinite loop).\n\n// Recursive call for this question: If uou didn't understand recursion, read the answer again
Score: 2.5