The right subtree of the tree is rooted at F and contains the nodes F, G, E, H. Its external (leaf) nodes are E and H (F has child G, and G has children E and H, so only E and H have no children).
Answer (b)
Size of the tree (total number of nodes) = 7 (nodes A, B, D, F, G, E, H).
Depth of the tree (number of edges on the longest root-to-leaf path) = 3 (e.g. A -> F -> G -> E, or A -> F -> G -> H).
Answer (c)
Post-order traversal (Left, Right, Root) of the tree: D B E H G F A