## Deepest Leaves Sum

Given a root node, return the sum of all the leaf node values. A leaf node can be defined as a node where the left and right child nodes are null. Our goal is to find the sum of all leaves. To start, we need to define our root node. This data structure typically has …