 A "k-ary tree" is a rooted tree in which each vertex has at most "k" children.2-ary trees are often called "binary trees", while 3-ary trees are sometimes called "ternary trees".An "ordered tree" (or "plane tree") is a rooted tree in which an ordering is specified for the children of each vertex.