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

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

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

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

Student answer: A tree in which each parent has a maximum of 2 children.
Score (0-5): 5

Student answer: a tree where each node has at most 2 children.
Score (0-5): 5

Student answer: a tree with up to two children or a right subtree and/or a left subtree
Score (0-5): 5

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

Student answer: a binary tree is a tree data structure in which each node has at most two children.
Score (0-5): 5

Student answer: a tree with only 2 joints, left and right
Score (0-5): 4.5

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

Student answer: a tree where each parent can have at max two children.
Score (0-5): 5

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

Student answer: a tree where each node can have at most 2 children.
Score (0-5): 5

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

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

Student answer: a tree that has a maximum of 2 children per node
Score (0-5): 5

Student answer: a tree with elements that can contain at most two pointers
Score (0-5): 5

Student answer: A binary tree can have only two children for each node.
Score (0-5): 5

Student answer: a tree where every parent has only two children
Score (0-5): 4.5

Student answer: A tree where every node has no more than two children
Score (0-5): 5

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

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

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