degree of a node: : =number of subtrees of the node. For exam ple, degree(A)=3, degree(F)=0 ③⑦ o degree of a tree: =nomeree degree(node ⑥⑥⑥⑦ For example, degree of this tree= 3 o' parent: : =a node that has subtrees e children ::=the roots of the subtrees of a parent s siblings =children of the same parent leaf terminal node): = a node with degree o(no children)A B C D E F G H I J K L M  degree of a node ::= number of subtrees of the node. For example, degree(A) = 3, degree(F) = 0.  degree of a tree ::= For example, degree of this tree = 3. max  degree(node )  nodetree  leaf ( terminal node ) ::= a node with degree 0 (no children).  parent ::= a node that has subtrees.  children ::= the roots of the subtrees of a parent.  siblings ::= children of the same parent