Viswa45/ASAG huggingface dataset:
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: you would have your list and add a back pointer so that your program knows where the end is
Score (0-5): 4
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: your queue storage class has a list, and for enqueue, you add the item to the end of the list, and for dequeue you return the first item in the list
Score (0-5): 4.5
Question: How can you implement a queue with a list?
Instructor answer: Keep the rear of the queue pointing to the tail of the linked list, so the enqueue operation is done at the end of the list, and keep the front of the queue pointing to the head of the linked list, so the dequeue operation is done at the beginning of the list.
Student answer: temp-&gt;next= NULL;<br>      if (front)  { (rear) -&gt; next= temp;}<br>      else front = temp;<br>      rear = temp;   }<br>
Score (0-5): 3.5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: Push.
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: push, which inserts something at the top of the stack.
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: The stack operation corresponding to enqueue in queues is the push operation.
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: Push in a stack operation corresponds to the enqueue operation in queues.  These operations insert a new item into one end(the top and back, respectively) of the ADT.
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: The stack operation is almost the opposite of the enqueue operation.
Score (0-5): 2.5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: push = enqueue<br>pop = dequeue
Score (0-5): 4.5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: push
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: Not sure what this question means.  You can use the stack 'push' operation and the enqueue operation to detect palindromes.
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: Enqueue is the queue equivalent of push, and dequeue is the queue equivalent to pop.
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: Push operation.
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: that would be the push operation, if it put the item at the end of the list.
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: the Push method in the stack operations.
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: enqueue corresponds with push<br>dequeue corresponds with pop
Score (0-5): 4.5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: Push corresponds with enqueue, both very similarly place new elements into their stack or queue
Score (0-5): 5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: FIFO: First in First out
Score (0-5): 1.5
Question: What is the stack operation corresponding to the enqueue operation in queues?
Instructor answer: push
Student answer: Push
Score (0-5): 5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A hierarchy of nodes that are sorted in a particular order.  Each node has a ancestor (except for the root) and children (except for the leaves).
Score (0-5): 4
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A tree is a finite set of one or more nodes with a specially designated node called the root and the remaining nodes are partitioned into disjoint sets where each of these sets is a tree.
Score (0-5): 5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A tree is a finite set of one or more nodes such that: there is a specially designated node called the root.
Score (0-5): 4.5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A connected, undirected graph without cycles.
Score (0-5): 4.5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A data structure that contains a root, internal nodes and external nodes. Each node references another node by means of pointers (pass-by-reference). The root is the "base" of the tree, it has no parents. A "leaf" is a node at the end of the tree which points to NULL.
Score (0-5): 5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: a tree is a series of nodes where each node has links to other nodes.
Score (0-5): 3
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: an infinite set of nodes that have a root and descendants, and each addition is a leaf.
Score (0-5): 3.5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A set of one or more nodes that are hierarchically organized, with one special “root” node.
Score (0-5): 4
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A tree is a finite set of one or more nodes such that there is a specially designated node called the root.<br>
Score (0-5): 3.5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: one or more nodes in a hierarchy starting with the root and branching off like a tree to subtrees
Score (0-5): 5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A tree is a data structure where nodes are linked to each other in a hierarchical manner.
Score (0-5): 3.5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: a grouping of data in a parent to child structure
Score (0-5): 3
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: It is a list of numbers in a list made by comparing values of nodes already in the tree and adding to the appropriate spot. Its a list made up of nodes with left and right pointers.
Score (0-5): 3
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A tree is a branched data structure with nodes, and leaves... a special node called root has no parent node, but however like all other nodes can and does have 2 nodes that it links to, namely one on the right, and one on the left.
Score (0-5): 4.5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: It organizes data in a nonlinear, hierarchical form, where items can have more than one successor.<br><br>Partitioned into a root node and subsets are general subtrees of the root.<br>
Score (0-5): 5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A tree is a finite set of one or more nodes such that there is a specially designated node called the root. The remaining nodes are partitioned into n&gt;=0 disjoint sets T the n plus 1, where each element set is a tree.
Score (0-5): 5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A finite set of nodes that starts with the root and terminates with leaves.
Score (0-5): 4
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: a set of data arranged with pointers. each element can have many pointers, but no two pointers point to the same element
Score (0-5): 2.5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A Tree is a data structure with one or more data nodes, each of which contains some data. Each node itself can have a number of attached child nodes, creating the branched structure Trees are named for.
Score (0-5): 4.5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: a finite collection of nodes, where it starts with an element called the root, which has children, and its children have children until you get to the leaves which are the last elements and have to children
Score (0-5): 4.5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A nonlinear, two-dimensional data structure.
Score (0-5): 2
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: a finite set of one or more nodes such that there is a root node and all other nodes are split into trees of lesser value than the root
Score (0-5): 4
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A finite number of nodes such that there is one root node, each node has a certain number of children nodes, and each child is also a tree
Score (0-5): 5
Question: What is a tree?
Instructor answer: A collection of nodes, which has a special node called root, and the rest of the nodes are partitioned into one or more disjoint sets, each set being a tree.
Student answer: A type of data structure in which each element is attached to one or more elements directly beneath it.
Score (0-5): 4
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: Each level of a generation in the tree, some people do not count the root as a generation
Score (0-5): 4
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The height of a tree is in terms of the levels of its nodes such that, if  the tree is empty its height is 0 otherwise its height is equal to the maximum level of its nodes.
Score (0-5): 4.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The height of a tree is the number of nodes on the longest path from the root to a leaf.
Score (0-5): 5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The number of nodes on the longest path from the root of the tree to a leaf.
Score (0-5): 5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: Height = the number of times you must progress down the levels of a tree to reach a leaf of the greatest distance from the root.
Score (0-5): 5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: the height of a tree is the length from the root to the furthest leaf
Score (0-5): 5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The height is the number of generations (levels) from the root.
Score (0-5): 4.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The height of a tree is the number of levels between the root and the leaf farthest away from it.
Score (0-5): 5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: is the depth of its furthest leaf
Score (0-5): 4.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: the number of nodes from root to leaf
Score (0-5): 3.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: the distance from the deepest leaf to the root
Score (0-5): 5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: the number of generations or levels of a tree
Score (0-5): 4.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The intensity of the children. Say you begin with one node, Thats one height. Then you add two children to that node and then two children to each of those nodes and two children to each of THOSE nodes. Youre current height would be 4.
Score (0-5): 3
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: the number of levels of a tree, like a tree can have at minimum a depth of 3 and at most a height of 8 for 8 nodes.
Score (0-5): 3.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The number of nodes on the longest path from the root to the leaf.
Score (0-5): 5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The height of a tree is the number of nodes on the longes path from the root to a leaf.
Score (0-5): 5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: is equal to the number of levels.  levels between the root node and the terminal nodes.
Score (0-5): 4.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: the number of generations or levels the tree has
Score (0-5): 4.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The height of a tree is the depth of its subtrees, that is, how many layers deep it is.
Score (0-5): 4.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: is the number of generations in the tree
Score (0-5): 4.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The number of nodes on the longest path from the root to a leaf.
Score (0-5): 5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: the number of distinct levels of separation
Score (0-5): 4
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: the height of a tree is how many levels of nodes that it has
Score (0-5): 4.5
Question: What is the height of a tree?
Instructor answer: The length of the longest path from the root to any of its leaves.
Student answer: The connections between elements are called branches. Trees are often called inverted trees because they are normally drawn with the root at the top.
Score (0-5): 1.5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: A leaf is a child of a parent node that has no children nodes of its own.
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: A leaf is a node with no children.
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: A node with no children.
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: A tree node with no children.
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: And end point of the tree... a node that does not have any children.
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: a node with no children.
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: A new item to the tree--a child
Score (0-5): 3
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: A leaf is a node with children, it is a terminating node.
Score (0-5): 2
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: The node with degree 0.
Score (0-5): 4
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: the node with degree 0
Score (0-5): 4
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: a leaf is a node with no children
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: the last child on any branch
Score (0-5): 4.5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: The last value in the tree. A value with no children attatched.
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: A leaf is a node with no children
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: a node with degree 0.  last node in the tree and furtherest away from the root.
Score (0-5): 4
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: an endpoint on a tree that contains no pointers or pointers that are set to null
Score (0-5): 4.5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: an element in a tree that has no children
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: a leaf is a node that has no children nodes
Score (0-5): 5
Question: What is a leaf?
Instructor answer: A node that has no children.
Student answer: The elements at the very bottom of an inverted tree (that is, those that have no elements below them) are called leaves.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A tree data structure in which each done has at most two children, typical called left and right nodes.  The right node is usually greater than the left node and the parent node.
Score (0-5): 4.5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A binary tree is a set of nodes that is either empty or partitioned into a root node and one or two subsets that are binary subtrees of the root. Each node can have no more than two children, a right and a left child.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A set of nodes that is either empty or partitioned into a root node and one or two subsets that are binary subtrees of the root.  Each node has at most two children, the left child and the right child.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A set of zero or more nodes, partitioned into a root node and two possibly empty sets that are binary trees. Thus, each node in a binary tree has at most two children, the left child and the right child.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A tree in which each parent has a maximum of 2 children.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a tree where each node has at most 2 children.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a tree with up to two children or a right subtree and/or a left subtree
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A binary tree is a tree in which all nodes have a maximum of two degrees, or can only have two children each.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a binary tree is a tree data structure in which each node has at most two children.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a tree with only 2 joints, left and right
Score (0-5): 4.5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A binary search tree is a tree that also has the condition that each node may have at maximum 2 children
Score (0-5): 4.5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a tree where each parent can have at max two children.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a list of numbers that are ordered compared to how they compare to the other numbers already added in the tree
Score (0-5): 2
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a tree where each node can have at most 2 children.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: Starting at the root node, it branches off into one or two subsets that are binary subtrees of the root.<br><br>Each node has at most two children, the left child and the right child.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A binary tree is a set of nodes that is either empty or partitioned into a root node and one or two subsets that are binary subtrees of the root. Each node has at most two children, the left child and the right child.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a tree that has a maximum of 2 children per node
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a tree with elements that can contain at most two pointers
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A binary tree can have only two children for each node.
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a tree where every parent has only two children
Score (0-5): 4.5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A tree where every node has no more than two children
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a binary tree is a special search tree where each node has either 2, 1, or 0 children
Score (0-5): 4.5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: a binary tree is a special type of tree where each node can only have at maximum 2 children
Score (0-5): 5
Question: What is a binary tree?
Instructor answer: A tree for which the maximum number of children per node is two.
Student answer: A binary tree is a special type of inverted tree in which each element has only two branches below it.
Score (0-5): 4.5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A tree data structure where each node has a value, where the total order is defined on these values.  the left subtree contains only values less than the parent node, and vice versa for the right subtree.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A binary search tree is a binary tree where the value in any node 'n' is greater than the value in every node in n's left subtree but less than every node in n's right subtree.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A binary tree where the value in any node n is greater than the value in every node in n's left subtree, but less than the value of every node in n's right subtree.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A binary tree where the search key in any node n is greater than the search key in any node in n's left subtree, but less than the search key in any node in n's right subtree.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A tree which is split based on values. This makes it very easy to search. One can compare the desired value to the root, and if the root is greater than, we search the left side of the tree, if it is less than, we search the right side... and do the same thing recursively.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: a tree where each node has at most two nodes and the node on the left is less than the root and the node on the right is greater than the root.
Score (0-5): 4.5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: a special binary tree that has a rule that all the subtrees on the right are smaller than the node value and all the subtrees on the left are larger than the node value
Score (0-5): 4
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: Binary search trees are similar to binary trees, but have been implemented to organize data in a specific way for later searching.
Score (0-5): 3.5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: it is a binary tree where each node has a value, a total order is defined on these values, the left subtree of a node contains only values less than the node's value, and the right subtree of a node contains only values greater than or equal to the node's value.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A binary tree with the data organized in a specific arangment
Score (0-5): 2.5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A binary search tree is a tree that also has the condition that each node may have at maximum 2 children and where the input data is compared to the data in the tree starting with the root. If the value is smaller than the root it traverses left, if it is larger it traverses right until it becomes a leaf.
Score (0-5): 4.5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: a binary tree in which the data is in order from left to right.
Score (0-5): 4
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: a tree that is set up so that it can be easily searched for numbers based on the location compared to the previous nodes.
Score (0-5): 3.5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: a binary tree where the children are ordered such that the right side is greater than the current node, and the left is less than or equal the current node.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A binary tree where the value in any node n is greater than the value in every node n's left subtree, but less than every value in n's right subtree.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A binary search tree is a finite set of nodes that is either empty or consits of a root and two disjoint binary trees call the left and right subtrees.
Score (0-5): 2.5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: it is similar to a binary tree.  The keys in a nonempty left subtree (right subtree) are smaller (larger) than the key in the root of subtree.  the values in all nodes in the left subtree of a node are less than          <br>  the node value<br> the values in all nodes in the right subtree of a node are greater <br>  than the node values<br><br>
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: a set of numbers arranged by links. each node can contain two pointers to other elements. each node to the left of the parent is smaller and each node to the right is larger. recursive implementation implies that if traversed in order, the output would be sorted
Score (0-5): 4.5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A binary search tree is a special binary tree arranged such that every left child node contains a value less than its parent, and every right child node contains a value greater its parent.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: a binary tree with a special organization of data. where the left child of the element is less than it, and the right child is larger than it.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: A tree in which the smaller values are located on the left of a parent node and the larger values are located on the right of the parent node.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: a binary search tree is a special tree in which each node has at most two children, labeled left child and right child
Score (0-5): 2.5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: it is a binary tree where each node has a unique key, the left child of a node has only values less than that node, and the right child of each node has higher values than that node.
Score (0-5): 5
Question: What is a binary search tree?
Instructor answer: A binary tree that has the property that for any node the left child is smaller than the parent which in turn is smaller than the right child.
Student answer: Binary search trees are a fundamental data structure used to construct more abstract data structures such as sets, multisets, and associative arrays.
Score (0-5): 2.5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: For every node in the binary tree we first visit its left sub-tree (if its there) and then visit the parent node itself, and then the right sub-tree (if its there).
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: The inorder traversal of a binary tree visits the node of a binary tree in order according to their data values.
Score (0-5): 2.5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: Traverses the binary tree in inorder.  It lets you visit the nodes in order according to their data values.
Score (0-5): 3
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: Its used to visit nodes of a binary search tree in a search key order.
Score (0-5): 3.5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: (Left side of tree) (Root) (Right side of tree)
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: printing a tree in order from least to greatest. This done by going as far left down the tree as possible and printing the parent and then right tree. Then move up the tree.
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: The in order is to go from left,root,right
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: Inorder traversal of a binary tree will retrieve start at the furthest left hand leaf and checks it, it’s parent, and it’s right side sibling, then it goes up a level and repeats until it gets to the root.
Score (0-5): 4.5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: traverse the left subtree. visit the root. traverse the right subtree.
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: postorder
Score (0-5): 1.5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: in order starts with the root then does right child then left child recursively
Score (0-5): 1.5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: Left Child -&gt; Parent -&gt; Right Child
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: it goes from lowest to highest inside of the tree
Score (0-5): 2
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: starting by displaying the node furthest to the right, then  the node, then the node on the right, in recursive order.
Score (0-5): 4
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: It travels left to right
Score (0-5): 3.5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: void inorder(ptNode ptr)<br>{<br>if (ptr)<br>{<br>inorder (ptr-&gt;left);<br>cout&lt;&lt;ptr-&gt;data;<br>inorder(ptr-&gt;right);<br>}<br>}
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: the root is in the middle.  The left subtree is traversed first, then the root, and finally the right subtree.
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: a traversal that visits the left branch first, then the parent node, then the right branch, recursively.
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: Inorder traversal visits the left branch of a node (all the way to it's deepest left-most leaf) before visiting the node itself. After visiting the entire left branch and the node, it visits the node's right branch following the same pattern of left child, node, right child.
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: left middle right
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: You traverse all the nodes to the left, then visit the root, then traverse all the nodes on the right.
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: you would go to the furthest down left most node, then to the root then to the right (if left and right exist) then you would return one node previous and do the same until you reached the root, then go to the furthest down left most node on the right side of the root and continue this process
Score (0-5): 5
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: it means that you traverse one subtree of a node, then look at the node itself before traversing the other subtree of the node
Score (0-5): 4
Question: What is the inorder traversal of a binary tree?
Instructor answer: Traverse the left subtree, then the root, then the right subtree.
Student answer: Level order traversal is a traversal method by which levels are visited successively starting with level 0 (the root node), and nodes are visited from left to right on each level, with Push and Pop methods.
Score (0-5): 2
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: This is on the runtime order of log(n) where n is the number of nodes in the binary tree.
Score (0-5): 5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: In a binary search tree of size 'n' it takes log(n) comparisons to find a specified element.
Score (0-5): 5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: n-1/2 is the algorithm to compare and find an element.
Score (0-5): 2
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: At most its equivalent to the height of the tree.
Score (0-5): 5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: Log(n)
Score (0-5): 5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: O(log n)
Score (0-5): 5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: Depends on what half of the tree and the levels you have.
Score (0-5): 3.5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: O(log n) in balanced trees
Score (0-5): 5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: n-1
Score (0-5): 2.5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: log(n)
Score (0-5): 5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: O(nlog(n))
Score (0-5): 2.5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: nLog(n)
Score (0-5): 2
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: logn
Score (0-5): 5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: at the minimum log(n)/log(2), at the maximum N searches, where N is the number of nodes.
Score (0-5): 4.5
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: O(n)
Score (0-5): 3
Question: How many comparisons does it take to find an element in a binary search tree?
Instructor answer: The height of the tree (or log of the number of elements in the tree).
Student answer: It takes at most 3 comparisons to find and element in a binary search tree
Score (0-5): 1.5