If anyone could do this I'd appreciate it.

We define a mobile tree as a binary tree with nodes of the following type: struct Node int weight the weight of this node itself Node* left; Node right Define the weight of a mobile tree to be the sum of the weights of all the nodes in the tree. The empty tree therefore has a weight of zero.) We say that a mobile tree is in balance if either: it is empty, or if the weights of its left and right subtrees are equal, and each of those subtrees is itself in balance. This mobile tree, for example, is in balance