Post-order traversal (Left, Right, Root) of the entire tree: A, C, E, D, B, H, I, G, F
Answer (b)
Right subtree (rooted at G): its nodes are G, I, H. Its internal nodes (nodes having at least one child) are G and I.
Left subtree (rooted at B): its nodes are B, A, D, C, E. Its external/leaf nodes (nodes with no children) are A, C and E.
Answer (c)
Size of the tree (total number of nodes) = 9 (F, B, G, A, D, I, C, E, H).
Degree of node D (number of children of D) = 2 (children C and E).