.g Definition 30: An ordered rooted tree is called an m-ary tree if every vertex has no more than m children. The tree is called a full m-ary tree if every vertex has exactly m children. An m-ary tree with m=2 is called a binary tree &o Left subtree, right subtree❖ Definition 30: An ordered rooted tree is called an m-ary tree if every vertex has no more than m children. The tree is called a full m-ary tree if every vertex has exactly m children. An m-ary tree with m=2 is called a binary tree. ❖ Left subtree, right subtree