The right subtree is rooted at C: F (children K and L) is its left child and G (right child M) its right child; L has the left child N.
In-order traversal (Left, Root, Right) of the right subtree: K, F, N, L, C, G, M
Answer (b)
Depth of the entire binary tree = 4 (longest path A, C, F, L, N has 4 edges).
Depth of node E = 2 (A, B, E).
Answer (c)
External nodes of the left subtree (rooted at B): I, J, E.
Internal nodes of the right subtree (rooted at C): C, F, G, L.