The Answer to the Question
is below this banner.
Here's the Solution to this Question
Full binary tree is a tree each vertcle of which has either 0 or 2 children. Internal verticle is a verticle that has children. Terminal verticle is a verticle that has no children
1) a, b, d, g - internal verticles. f, e, c, i, h - terminal verticles
2) Height of a tree is a max distance from its root to the terminal verticle. Full binary tree with height 3 has no more than terminal points, so there is no full binary tree with such properties
3) j, k, e, l, m, n, o, p, q - terminal verticles. Path with max distance is a-b-d-f-j(or k) - 4 steps