A ternary tree is an ordered tree where each node has either $0$ or $3$ children. Such a tree is full if all leaves are at the same distance from the root. Derive an explicit formula for the number of leaves and the total number of nodes, in a full ternary tree of height h.
Here's what I know, number of nodes = number of edges + $1$ AND with $i$ internal vertices has $l = (m - 1)i + 1$ leaves. But how exactly do I create an explicit formula for number of leaves and total number of nodes?