question 3. a full ternary tree is a tree whose internal nodes each have exactly three children. (a) write a recursive definition for a full ternary tree. (b) write a recursive definition for the number of internal nodes i(t) in a full ternary tree. (c) write a recursive definition for the number of external nodes e(t) in a full ternary tree. (d) write a recursive definition for the total number of nodes n(t) in a full ternary tree.



Answer :

Other Questions