Write a Haskell definition of ternary trees, plus procedures for generating balanced ternary trees and counting their node numbers.

Counting the Nodes of a Balanced m-ary Tree. The number of nodes of a balanced m-ary tree of depth n (with m > 1) is given by . Here is a proof by mathematical induction.