Definitions
A tree t is a finite nonempty set of elements. One of these elements is called a root, and the remaining elements (if any) are partitioned into trees that are called subtrees of t.
children of the root -- root of subtree
parent of an element/ grandparent/ ancestor/ descendent/...
leaves: elements with no children
degree of an element: # children
degree of a tree: max degree of any element