Match the term with each definition:

Question

In a binary tree, the left child (if any) of a node plus its descendants
	The number of nodes on the longest path from the root to a leaf
	A node on a path from a node to a leaf
	Set of nodes, T, such that either T is empty or T is partitioned into three disjoint sets (a single node r, called the root, and two (possibly empty) sets that are binary trees, called left and right subtrees of T).
	A binary tree such that for any given data item, x, in the tree, every node in the left subtree of x contains only items less than x. Every node in the right subtree of x contain only items greater than x.
	Nodes which have the same parent
	A node on the path from the root to a node
	A node directly "above" a node in the tree
	The node in a tree that has no parent
	If the node is the root, then the value is one. Otherwise, it's the value of one greater than the value of its parent
	A tree with the maximum difference in height of one between any two subtrees of a node
	A tree that consists of a node and its descendants (if any)
	A node directly "below" a node in the tree
	A binary tree which has all possible nodes in the last level
	A node directly "below" and to the left of a node in a binary tree
	A node that has no children
	A set of one or more nodes, partitioned into a root node and subsets that are general subtrees of the root
	A binary tree with no nodes
	A tree which has all possible nodes down to the second to last level, with the last level filled in from left to right

Question 1 options: